Constraints among Argument Sizes in Logic Programs (Extended Abstract)
Summary: Formalizes interargument size constraints as a fixpoint of a recursive transformation over convex-hulls of argument-size point sets, exposing potential non-finite convergence of the operator. Proposes affine-hull approximation to ensure finite convergence and derives exact constraints for a class of linear recursive programs satisfying a translativeness property via structural analysis of the recursive transformation. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Kirack Sohn
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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,339 | Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract) | 1989 | PODS | 9.005745e-05 |
| 3,106 | Deriving Constraints Among Argument Sizes in Logic Programs (Extended Abstract) | 1990 | PODS | 7.5562924e-05 |
| 3,435 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.0966834e-05 |
| 7,266 | Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract) | 1991 | PODS | 4.782728e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,339 | Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract) | 1989 | PODS | 9.005745e-05 |
| 4,141 | Explicit Control of Logic Programs Through Rule Algebra | 1988 | PODS | 6.4141369e-05 |
| 856 | Querying Constraints | 1990 | PODS | 0.00015892437 |
| 7,018 | Hard problems for simple logic programs | 1990 | SIGMOD | 4.8602644e-05 |
| 7,598 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.7004867e-05 |
| 5,180 | Linearizing nonlinear recursions in polynomial time (Extended Abstract) | 1989 | PODS | 5.6422249e-05 |
| 1,979 | Logic Programming as Constructivism: A Formalization and its Application to Databases | 1989 | PODS | 9.8794371e-05 |
| 3,435 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.0966834e-05 |
| 7,266 | Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract) | 1991 | PODS | 4.782728e-05 |
| 3,106 | Deriving Constraints Among Argument Sizes in Logic Programs (Extended Abstract) | 1990 | PODS | 7.5562924e-05 |