Database Paper Browser

Back to papers

Inference of Inequality Constraints in Logic Programs (Extended Abstract)

Summary: Algorithmic inference of size-inequality constraints among logic-program arguments to establish top-down termination and assist bottom-up safety proofs. Emphasizes practical, decidable sufficient conditions (e.g., monotonicity-based) for programs with function symbols. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
940
Venue
PODS
Year
1991
Pagerank
7.0966834e-05
Overall Rank
3,435 | 76.11%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
620 Constraint Programming and Database Languages: A Tutorial 1995 PODS 0.00019005954
2,861 Pushing Constraint Selections 1992 PODS 7.9919152e-05
3,857 Constraints and Redundancy in Datalog 1992 PODS 6.6939005e-05
7,266 Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract) 1991 PODS 4.782728e-05
12,824 Constraints among Argument Sizes in Logic Programs (Extended Abstract) 1994 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers