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
h4afd1cfed63bac5f
Venue
PODS
Year
1994
Pagerank
4.9793485e-05
Overall Rank
13,313 | 10.50%
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
62 Maintaining Views Incrementally 1993 SIGMOD 0.00039045511
177 Decidability And Expressiveness Aspects Of Logic Queries 1987 PODS 0.000266613
531 The Magic of Duplicates and Aggregates 1990 VLDB 0.00016847212
1,438 Magic is Relevant 1990 SIGMOD 0.00010648031
1,830 Decidability and Undecidability Results for Boundedness of Linear Recursive Queries 1988 PODS 9.5498891e-05
2,062 A Decidable Class of Bounded Recursions 1987 PODS 9.0974416e-05
2,716 Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions 1993 PODS 8.1006747e-05
3,886 Constraints and Redundancy in Datalog 1992 PODS 6.9461797e-05
4,712 Tools for Datalog Boundedness 1991 PODS 6.4568103e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

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