MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Vorobyov, Sergei
Voronkov, Andrei		dblp
dblp
Editor(s):
BibTeX cite key*:
VorobyovVoronkov1998PODS
Title, Booktitle
Title*:
Complexity of Nonrecursive Logic Programs with Complex Values
Booktitle*:
Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-98)
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Saeattle, Washington, U.S.A.
Language:
English
Event Date*
(no longer used):
June 1-4, 1998
Organization:
Asoc Comput Machinery, Boeing
Event Start Date:
Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected
Event End Date:
Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected
Publisher
Name*:
ACM
URL:
Address*:
New York, USA
Type:
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
June
Pages:
244-253
Year*:
1998
VG Wort Pages:
ISBN/ISSN:
0-89791-996-3
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
 We investigate complexity of the $\success$ problem for logic query
languages with complex values: check whether a query defines a
nonempty set. The $\success$ problem for recursive query languages
with complex values is undecidable, so we study the complexity of
nonrecursive queries. By complex values we understand values such as
trees, finite sets, and multisets. Due to the well-known
correspondence between relational query languages and datalog, our
results can be considered as results about relational query
languages with complex values. The paper gives a complete complexity
classification of the $\success$ problem for nonrecursive logic
programs over trees depending on the underlying signature, presence
of negation, and range restrictedness. We also prove several results
about finite sets and multisets.
Keywords:
Database query languages, logic programming, complexity
Download
Access Level:
Internal

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
Expert
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography



BibTeX Entry:
@INPROCEEDINGS{VorobyovVoronkov1998PODS,
AUTHOR = {Vorobyov, Sergei and Voronkov, Andrei},
 TITLE = {Complexity of Nonrecursive Logic Programs with Complex Values},
 BOOKTITLE = {Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-98)},
 PUBLISHER = {ACM},
 YEAR = {1998},
 ORGANIZATION = {Asoc Comput Machinery, Boeing},
 PAGES = {244--253},
 ADDRESS = {Saeattle, Washington, U.S.A.},
 MONTH = {June},
 ISBN = {0-89791-996-3},
}

Entry last modified by Uwe Brahm, 03/12/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Sergei Vorobyov		Created
01/15/1999 12:10:32 PM
Revisions
10.
9.
8.
7.
6.		Editor(s)
Uwe Brahm
Uwe Brahm
Christine Kiesel
Uwe Brahm
Uwe Brahm		Edit Dates
2007-07-02 14:46:42
2007-07-02 14:44:56
28.08.2001 15:10:21
01.04.99 17:38:36
01.04.99 09:47:30