Sergei Vorobyov, Andrei Voronkov  Home/Search
Context Related
| mpisb.mpg.de/~sv/public...pods98.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mpisb.mpg.de/~sv/indexcom (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Context of citations to this paper: More
.... Full version available as Research Report MPI I 97 2 010 from http: data.mpi sb.mpg.de internet reports.nsf NumberView 97 2 010, [62] In: Proceedings of the Seventeenth ACM SIGACTSIGMOD SIGART Symposium on Principles of Database Systems (PODS 98) June 1 3, 1998,...
...sets of cind s) are NEXPTIMEcomplete. Membership in NEXPTIME follows from the more general result on nonrecursive logic programming [7, 21] and hardness can be shown by a modi cation of the reduction from the TILING problem of [7] For lack of space, we have refer to [14] for...
Cited by: More
Query Rewriting with Symmetric - Constraints Christoph Koch (Correct)
Tree Extension Algebras: Logics, Automata, and Query Languages - Benedikt, Libkin (Correct)
Query Rewriting with Symmetric Constraints - Koch (2002) (Correct)
Similar documents (at the sentence level):
67.7%: Complexity of Nonrecursive Logic Programs with Complex Values - Vorobyov, Voronkov (1997) (Correct)
Active bibliography (related documents): More All
0.9: Expressive Power and Data Complexity of Nonrecursive Logic.. - Dantsin, Voronkov (1998) (Correct)
0.6: Complexity of Query Answering in Logic Databases with Complex .. - Dantsin, Voronkov (1998) (Correct)
0.6: Complexity and Uniformity of Elimination in Presburger Arithmetic - Weispfenning (1997) (Correct)
Similar documents based on text: More All
0.5: Expressive Power and Data Complexity of Nonrecursive - Query Languages For (Correct)
0.4: Fixed-Parameter Complexity of Semantics for Logic Programs - Lonc, Truszczynski (Correct)
0.2: On Proof-Search in Intuitionistic Logic with Equality, or Back.. - Voronkov (1996) (Correct)
Related documents from co-citation: More All
5: Complexity of query answering in logic databases with complex values - Dantsin, Voronkov
4: Foundations of databases (context) - Abiteboul, Hull et al. - 1995
3: Querying heterogeneous information sources using source descriptions - Levy, Rajaraman et al. - 1996
BibTeX entry: (Update)
S. Vorobyov and A. Voronkov. Complexity of nonrecursive logic programs with complex values. Technical Report MPI-I-97-2-010, Max-Planck Institut fur Informatik, Saarbrucken, November 1997. 10 http://citeseer.ist.psu.edu/article/vorobyov98complexity.html More
@inproceedings{ vorobyov98complexity,
author = "Sergei Vorobyov and Andrie Voronkov",
title = "Complexity of Nonrecursive Logic Programs with Complex Values",
pages = "244--253",
year = "1998",
url = "citeseer.ist.psu.edu/article/vorobyov98complexity.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
775 Foundation of Databases (context) - Abiteboul, Hull et al. - 1995
759 Negation as failure (context) - Clark - 1978
435 Towards a theory of declarative knowledge (context) - Apt, Blair - 1988
379 The complexity of relational query languages (context) - Vardi - 1982
315 Constraint query languages - Kanellakis, Kuper et al. - 1995
291 Theoretical Computer Science (context) - Berman, of - 1980
274 A catalog of complexity classes (context) - Johnson - 1990
245 Relational queries computable in polynomial time - Immerman - 1986
211 Languages that capture complexity classes - Immerman - 1987
204 the declarative semantics of deductive databases and logic p.. (context) - On - 1988
192 Logic programming (context) - Apt - 1990
186 Negation in logic programming (context) - Kunen - 1987
180 Logic programming and negation: a survey - Apt, Bol - 1994
133 Cambridge University Press (context) - Hodges - 1993
129 Theoretical Computer Science (context) - Stockmeyer, hierarchy - 1977
128 Declarative modeling of the operational behavior of logic la.. (context) - Falashi, Levi et al. - 1989
118 Complete axiomatizations of the algebras of finite (context) - Maher - 1988
75 Complexity and expressive power of logic programming - Dantsin, Eiter et al. - 1997
67 Negation as failure using tight derivations for general logi.. (context) - Van Gelder - 1988
63 Admissible Sets and Structures (context) - Barwise - 1975
57 A logic programming view of CLP - Maher - 1993
52 the declarative semantics of logic programs with negation (context) - Lifschitz - 1988
52 Logic programming with sets - Kuper - 1990
47 the complexity of bounded-variable queries (context) - Vardi - 1995
46 Journal of the Association for Computing Machinery (context) - Chandra, Kozen et al. - 1981
44 the expressive power of database queries with intermediate t.. (context) - Hull, Su - 1991
43 The computational complexity of logical theories (context) - Ferrante, Rackoff - 1979
40 flogg: A language for programming in logic with finite sets - Dovier, Omodeo et al. - 1996
39 Word problems requiring exponential time: Preliminary report (context) - Stockmeyer, Meyer - 1973
39 Set constructors in a logic database language (context) - Beeri, Naqvi et al. - 1991
32 Extending SLD-resolution to equational Horn clauses using E-.. (context) - Gallier, Raatz - 1989
31 Answer sets and negation as failure (context) - Kunen - 1987
28 The power of languages for the manipulation of complex value.. - Abiteboul, Beeri - 1995
24 Annals of Mathematics and Artificial Intelligence (context) - Blair, Marek et al. - 1995
21 An improved lower bound for the elementary theories of trees - Vorobyov - 1996
21 Languages for relational databases over interpreted structur.. - Benedikt, Libkin - 1997
20 Computing Science Department (context) - Dantsin, Voronkov et al. - 1997
20 Complexity and undecidability results in logic programming (context) - Schlipf - 1995
19 the complexity of database queries (context) - Papadimitriou, Yannakakis - 1997
18 The inherent computational complexity of theories of ordered.. (context) - Meyer - 1974
18 the complexity of queries in the logical data model - Kuper, Vardi - 1993
18 and computable queries (context) - Hull, Su et al. - 1989
17 Horn clause computability (context) - Tarnlund - 1977
16 A simple method for undecidability proofs and some applicati.. (context) - Rabin - 1964
14 Arithmetic classification of perfect models of stratified pr.. (context) - Apt, Blair - 1988
13 A theory of propositional types (context) - Henkin - 1963
12 On time-space classes and their relation to the theory of re.. - Bruss, Meyer - 1980
12 Complexity of query answering in logic databases with comple.. - Dantsin, Voronkov - 1997
12 Complexity of query answering in logic databases with comple.. - Dantsin, Voronkov - 1997
10 Sentences true in all constructive models (context) - Vaught - 1960
8 A CLP view of logic programming - Maher - 1992
7 Precise bounds for Presburger arithmetic and the reals with .. (context) - Berman - 1977
6 Compilation of set terms in the logic data language (context) - Schmueli, Tsur et al. - 1992
6 the elementary theories of locally free universal algebras (context) - Ma, On - 1961
5 Complexity of nonrecursive logic programs with complex value.. - Vorobyov, Voronkov - 1997
3 natural decidable theory (context) - Vorobyov, hardest - 1997
2 A new hierarchy of elementary recursive decision problems (context) - Volger - 1983
2 Turing machines with linear alternation (context) - Volger - 1983
2 The complexity of Prolog without loops (context) - Dantsin - 1986
Documents on the same site (http://www.mpi-sb.mpg.de/~sv/index-com.html): More
The "Hardest" Natural Decidable Theory - Vorobyov (1997) (Correct)
An Improved Lower Bound for the Elementary Theories of Trees - Vorobyov (1996) (Correct)
On the Decision Complexity of the Bounded Theories of Trees - Vorobyov (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC