DBScholar

Back to papers

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)

Paper ID
1029
Venue
PODS
Year
1994
Pagerank
5.093636e-05
Overall Rank
13,023 | 10.66%
DOI
10.1145/182591.182612

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{mumick_pods94,
        address = {New York, NY, USA},
        series = {{PODS} '94},
        title = {{Universal Finiteness and Satisfiability}},
        url = {https://dl.acm.org/doi/10.1145/182591.182612},
        doi = {10.1145/182591.182612},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Mumick, Inderpal Singh and Shmueli, Oded},
        year = {1994}
}

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
61 Maintaining Views Incrementally 1993 SIGMOD 0.00039026867
174 Decidability And Expressiveness Aspects Of Logic Queries 1987 PODS 0.00027231487
527 The Magic of Duplicates and Aggregates 1990 VLDB 0.00017108864
1,410 Magic is Relevant 1990 SIGMOD 0.00010853223
1,788 Decidability and Undecidability Results for Boundedness of Linear Recursive Queries 1988 PODS 9.7653696e-05
2,015 A Decidable Class of Bounded Recursions 1987 PODS 9.3047297e-05
2,662 Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions 1993 PODS 8.2831426e-05
3,812 Constraints and Redundancy in Datalog 1992 PODS 7.105413e-05
4,615 Tools for Datalog Boundedness 1991 PODS 6.6050069e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 7,454 Modular Acyclicity and Tail Recursion in Logic Programs 1991 PODS
2 1,788 Decidability and Undecidability Results for Boundedness of Linear Recursive Queries 1988 PODS
3 8,506 Checking Consistency of Database Constraints: a Logical Basis 1986 VLDB
4 8,128 Decidability and Undecidability Results for the Termination Problem of Active Database Rules 1998 PODS
5 1,630 On the Decidability of Query Containment under Constraints 1998 PODS
6 2,662 Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions 1993 PODS
7 4,615 Tools for Datalog Boundedness 1991 PODS
8 6,286 Finite Queries do not Have Effective Syntax 1995 PODS
9 7,972 On the First-Order Expressibility of Recursive Queries 1989 PODS
10 6,077 Safety of Datalog Queries over Infinite Databases 1989 PODS