Complexity of Nonrecursive Logic Programs with Complex Values
Summary: Complete complexity classification of SUCCESS (nonemptiness) for nonrecursive logic programs producing complex values (trees), across signature, presence of negation, and range-restriction. Also provides complexity bounds for finite sets/multisets and links to relational queries via the datalog correspondence. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sergei Vorobyov (Max Planck Institute)
- 2. Andrei Voronkov (Uppsala University)
BibTeX Citation
@inproceedings{vorobyov_pods98,
address = {New York, NY, USA},
series = {{PODS} '98},
title = {{Complexity of Nonrecursive Logic Programs with Complex Values}},
url = {https://dl.acm.org/doi/10.1145/275487.275515},
doi = {10.1145/275487.275515},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Vorobyov, Sergei and Voronkov, Andrei},
year = {1998}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,702 | On the Complexity of Nonrecursive XQuery and Functional Query Languages on Complex Values | 2005 | PODS | 6.5549225e-05 |
| 6,098 | The Impact of Virtual Views on Containment | 2010 | VLDB | 5.9778168e-05 |
| 6,184 | Expressive power and data complexity of nonrecursive query languages for lists and trees (Extended Abstract) | 2000 | PODS | 5.9488379e-05 |
| 7,654 | Positive Higher-Order Queries | 2010 | PODS | 5.5746273e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00018893507 |
| 763 | On the Complexity of Bounded-Variable Queries | 1995 | PODS | 0.00014230134 |
| 2,400 | Untyped Sets, Invention, and Computable Queries | 1989 | PODS | 8.6299917e-05 |
| 4,336 | Languages for Relational Databases over Interpreted Structures | 1997 | PODS | 6.7554436e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,886 | Polynomial-time program transformations in deductive databases | 1990 | PODS |
| 2 | 2,600 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS |
| 3 | 7,654 | Positive Higher-Order Queries | 2010 | PODS |
| 4 | 633 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 5 | 1,864 | The Expressiveness of a Family of Finite Set Languages | 1991 | PODS |
| 6 | 6,613 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 7 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |
| 8 | 4,702 | On the Complexity of Nonrecursive XQuery and Functional Query Languages on Complex Values | 2005 | PODS |
| 9 | 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 10 | 6,184 | Expressive power and data complexity of nonrecursive query languages for lists and trees (Extended Abstract) | 2000 | PODS |