Database Paper Browser

Back to papers

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)

Paper ID
939
Venue
PODS
Year
1991
Pagerank
4.782728e-05
Overall Rank
7,266 | 49.46%
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,435 Inference of Inequality Constraints in Logic Programs (Extended Abstract) 1991 PODS 7.0966834e-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 4 of 4 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