Database Paper Browser

Back to papers

Tie-Breaking Semantics and Structural Totality (Extended Abstract)

Summary: Introduce tie-breaking semantics for Datalog with negation: a polynomial-time computable fixpoint semantics that guarantees a fixpoint whenever the rule–goal graph has no cycle with an odd number of negative edges. Show maximality: presence of an odd-negative cycle implies non-structural totality (an alphabetic variant lacking any fixpoint) and nonstructural totality is undecidable. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
951
Venue
PODS
Year
1992
Pagerank
5.7267485e-05
Overall Rank
5,063 | 64.78%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
3,852 Negation and Minimality in Non-Horn Databases 1993 PODS 6.7017663e-05
12,797 Structural Totality and Constraint Stratification 1995 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
200 OPTIMIZING DATALOG PROGRAMS (Extended Abstract) 1987 PODS 0.00035012858
Previous Page 1 / 1 Next

Semantically Similar Papers