Deriving Constraints Among Argument Sizes in Logic Programs (Extended Abstract)
Summary: Model feasible argument-size vectors as a polyhedral convex set (“polycone”), use its faces to capture inequalities for termination-aware evaluation and take the closure of the convex hull as the smallest enclosing polycone for multi-rule predicates to preserve convexity. Present a generalized Tucker representation with unique normal form and an algorithmic equality test for polycones, and handle recursion by computing fixpoint polycones (with some methods provided and open problems remaining). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 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,435 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.0966834e-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 |
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 63 | A Message Passing Framework for Logical Query Evaluation | 1986 | SIGMOD | 0.00063714145 |
| 452 | CONVERGENCE OF SIDEWAYS QUERY EVALUATION (Extended Abstract) | 1986 | PODS | 0.00022799064 |
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,644 | Compiling Existential-Positive Queries to Bounded-Variable Fragments | 2019 | PODS | 4.1945683e-05 |
| 4,141 | Explicit Control of Logic Programs Through Rule Algebra | 1988 | PODS | 6.4141369e-05 |
| 1,979 | Logic Programming as Constructivism: A Formalization and its Application to Databases | 1989 | PODS | 9.8794371e-05 |
| 4,631 | Tools for Datalog Boundedness | 1991 | PODS | 6.0347472e-05 |
| 7,598 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.7004867e-05 |
| 856 | Querying Constraints | 1990 | PODS | 0.00015892437 |
| 5,180 | Linearizing nonlinear recursions in polynomial time (Extended Abstract) | 1989 | PODS | 5.6422249e-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 |
| 12,824 | Constraints among Argument Sizes in Logic Programs (Extended Abstract) | 1994 | PODS | 4.1945683e-05 |