Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract)
Summary: Automated termination test that models predicate argument sizes as vectors in R^n and finds a nonnegative linear combination guaranteed to decrease in top-down recursion. Uses LP duality to handle nonlinear/mutual recursion; only a sufficient criterion and needs syntactic rewrites. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kirack Sohn
- 2. Allen Van Gelder
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,765 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.1943699e-05 |
| 12,833 | Constraints among Argument Sizes in Logic Programs (Extended Abstract) | 1994 | PODS | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,083 | Querying Constraints | 1990 | PODS | 9.2672918e-05 |
| 2,538 | Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract) | 1989 | PODS | 8.5141183e-05 |
| 3,313 | Deriving Constraints Among Argument Sizes in Logic Programs (Extended Abstract) | 1990 | PODS | 7.5956603e-05 |
| 3,765 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.1943699e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,612 | Complexity of Nonrecursive Logic Programs with Complex Values | 1998 | PODS | 5.8835431e-05 |
| 7,422 | Hard problems for simple logic programs | 1990 | SIGMOD | 5.6863842e-05 |
| 1,988 | A Decidable Class of Bounded Recursions | 1987 | PODS | 9.4472605e-05 |
| 4,543 | Tools for Datalog Boundedness | 1991 | PODS | 6.7073012e-05 |
| 7,850 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 5.6011137e-05 |
| 7,333 | Modular Acyclicity and Tail Recursion in Logic Programs | 1991 | PODS | 5.6988474e-05 |
| 5,226 | Linearizing nonlinear recursions in polynomial time (Extended Abstract) | 1989 | PODS | 6.3779246e-05 |
| 3,313 | Deriving Constraints Among Argument Sizes in Logic Programs (Extended Abstract) | 1990 | PODS | 7.5956603e-05 |
| 12,833 | Constraints among Argument Sizes in Logic Programs (Extended Abstract) | 1994 | PODS | 5.1725247e-05 |
| 3,765 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.1943699e-05 |