Universal Finiteness and Satisfiability
Summary: Reduce universal finiteness to satisfiability (and vice versa), so decidability/undecidability results transfer between them for Datalog variants. Define acyclicity as non‑satisfiability of a recursive program and show such acyclicity preserves decidability, while arbitrary constraints do not. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 95 | Maintaining Views Incrementally | 1993 | SIGMOD | 0.00050896659 |
| 172 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS | 0.00038808816 |
| 445 | The Magic of Duplicates and Aggregates | 1990 | VLDB | 0.0002294367 |
| 1,423 | Magic is Relevant | 1990 | SIGMOD | 0.00012054867 |
| 1,991 | Decidability and Undecidability Results for Boundedness of Linear Recursive Queries | 1988 | PODS | 9.84713e-05 |
| 2,206 | A Decidable Class of Bounded Recursions | 1987 | PODS | 9.2910236e-05 |
| 2,830 | Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions | 1993 | PODS | 8.054172e-05 |
| 3,857 | Constraints and Redundancy in Datalog | 1992 | PODS | 6.6939005e-05 |
| 4,631 | Tools for Datalog Boundedness | 1991 | PODS | 6.0347472e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,876 | Modular Acyclicity and Tail Recursion in Logic Programs | 1991 | PODS | 4.8977465e-05 |
| 1,991 | Decidability and Undecidability Results for Boundedness of Linear Recursive Queries | 1988 | PODS | 9.84713e-05 |
| 8,269 | Checking Consistency of Database Constraints: a Logical Basis | 1986 | VLDB | 4.5455963e-05 |
| 7,774 | Decidability and Undecidability Results for the Termination Problem of Active Database Rules | 1998 | PODS | 4.6543275e-05 |
| 1,490 | On the Decidability of Query Containment under Constraints | 1998 | PODS | 0.00011699154 |
| 2,830 | Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions | 1993 | PODS | 8.054172e-05 |
| 4,631 | Tools for Datalog Boundedness | 1991 | PODS | 6.0347472e-05 |
| 6,382 | Finite Queries do not Have Effective Syntax | 1995 | PODS | 5.0890445e-05 |
| 7,591 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS | 4.702934e-05 |
| 4,136 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS | 6.4188795e-05 |