Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions
Summary: Characterizes decidability for Datalog with stratified negation and dense-order constraints: query-reachability and satisfiability decidable when negation applies only to EDBs or all EDBs are unary; equivalence decidable in the unary-EDB case. Provides algorithms to push constraints to EDBs and proves satisfiability undecidable for unary-IDB programs with stratified negation plus interpreted ≠. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alon Y. Levy (Stanford University)
- 2. Inderpal Singh Mumick (AT&T)
- 3. Yehoshua Sagiv (Hebrew University)
- 4. Oded Shmueli (Technion)
BibTeX Citation
@inproceedings{levy_pods93,
address = {New York, NY, USA},
series = {{PODS} '93},
title = {{Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions}},
url = {https://dl.acm.org/doi/10.1145/153850.153860},
doi = {10.1145/153850.153860},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Levy, Alon Y. and Mumick, Inderpal Singh and Sagiv, Yehoshua and Shmueli, Oded},
year = {1993}
}
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 174 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS | 0.00027231487 |
| 953 | On the Equivalence of Recursive and Nonrecursive Datalog Programs | 1992 | PODS | 0.00012997935 |
| 1,856 | Automata Theory for Database Theoreticians | 1989 | PODS | 9.6053834e-05 |
| 3,476 | Data Functions, Datalog and Negation (Extended Abstract) | 1988 | SIGMOD | 7.3807586e-05 |
| 3,812 | Constraints and Redundancy in Datalog | 1992 | PODS | 7.105413e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,093 | Efficiently Ordering Subgoals with Access Constraints [Extended Abstract] | 2006 | PODS |
| 2 | 7,972 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS |
| 3 | 1,630 | On the Decidability of Query Containment under Constraints | 1998 | PODS |
| 4 | 13,023 | Universal Finiteness and Satisfiability | 1994 | PODS |
| 5 | 6,221 | Well-Founded Semantics for Extended Datalog and Ontological Reasoning | 2013 | PODS |
| 6 | 3,476 | Data Functions, Datalog and Negation (Extended Abstract) | 1988 | SIGMOD |
| 7 | 3,812 | Constraints and Redundancy in Datalog | 1992 | PODS |
| 8 | 313 | OPTIMIZING DATALOG PROGRAMS (Extended Abstract) | 1987 | PODS |
| 9 | 2,883 | Semantic Query Optimization in Datalog Programs (Extended Abstract) | 1995 | PODS |
| 10 | 853 | Queries Independent of Updates | 1993 | VLDB |