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)
Incoming Non-self Citations Over Time
Authors
- 1. Alexander Brodsky (Hebrew University)
- 2. Yehoshua Sagiv (Hebrew University; Stanford University)
BibTeX Citation
@inproceedings{brodsky_pods91,
address = {New York, NY, USA},
series = {{PODS} '91},
title = {{Inference of Inequality Constraints in Logic Programs (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/113413.113434},
doi = {10.1145/113413.113434},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Brodsky, Alexander and Sagiv, Yehoshua},
year = {1991}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 889 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00013398105 |
| 2,876 | Pushing Constraint Selections | 1992 | PODS | 8.0075966e-05 |
| 3,812 | Constraints and Redundancy in Datalog | 1992 | PODS | 7.105413e-05 |
| 7,824 | Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract) | 1991 | PODS | 5.5368828e-05 |
| 13,018 | Constraints among Argument Sizes in Logic Programs (Extended Abstract) | 1994 | PODS | 5.093636e-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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 174 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS | 0.00027231487 |
| 1,498 | Safety of Recursive Horn Clauses With Infinite Relations | 1987 | PODS | 0.00010567892 |
| 2,579 | Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract) | 1989 | PODS | 8.3906191e-05 |
| 3,025 | An Axiomatic Approach to Deciding Query Safety in Deductive Databases | 1988 | PODS | 7.8386928e-05 |
| 3,355 | A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract) | 1988 | SIGMOD | 7.4912272e-05 |
| 3,360 | Deriving Constraints Among Argument Sizes in Logic Programs (Extended Abstract) | 1990 | PODS | 7.4890377e-05 |
| 6,077 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS | 5.9850223e-05 |
| 7,824 | Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract) | 1991 | PODS | 5.5368828e-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 | 174 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS |
| 3 | 4,634 | Translation and Optimization of Logic Queries: The Algebraic Approach | 1986 | VLDB |
| 4 | 2,111 | Querying Constraints | 1990 | PODS |
| 5 | 3,355 | A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract) | 1988 | SIGMOD |
| 6 | 2,579 | Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract) | 1989 | PODS |
| 7 | 3,360 | Deriving Constraints Among Argument Sizes in Logic Programs (Extended Abstract) | 1990 | PODS |
| 8 | 6,077 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS |
| 9 | 13,018 | Constraints among Argument Sizes in Logic Programs (Extended Abstract) | 1994 | PODS |
| 10 | 7,824 | Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract) | 1991 | PODS |