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
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,612 | On the Complexity of Nonrecursive XQuery and Functional Query Languages on Complex Values | 2005 | PODS | 6.0428289e-05 |
| 5,516 | Expressive power and data complexity of nonrecursive query languages for lists and trees (Extended Abstract) | 2000 | PODS | 5.4685963e-05 |
| 7,244 | Positive Higher-Order Queries | 2010 | PODS | 4.7856771e-05 |
| 7,272 | The Impact of Virtual Views on Containment | 2010 | VLDB | 4.7760673e-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 |
|---|---|---|---|---|
| 432 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00023349408 |
| 603 | On the Complexity of Bounded-Variable Queries | 1995 | PODS | 0.00019334592 |
| 2,520 | Untyped Sets, Invention, and Computable Queries | 1989 | PODS | 8.6044305e-05 |
| 4,343 | Languages for Relational Databases over Interpreted Structures | 1997 | PODS | 6.2665123e-05 |
Previous
Page 1 / 1
Next