DBScholar

Back to papers

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)

Paper ID
887
Venue
PODS
Year
1990
Pagerank
7.4890377e-05
Overall Rank
3,360 | 76.95%
DOI
10.1145/298514.298541

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gelder_pods90,
        address = {New York, NY, USA},
        series = {{PODS} '90},
        title = {{Deriving Constraints Among Argument Sizes in Logic Programs (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/298514.298541},
        doi = {10.1145/298514.298541},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Van Gelder, Allen},
        year = {1990}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

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
343 A Message Passing Framework for Logical Query Evaluation 1986 SIGMOD 0.00020669253
1,051 CONVERGENCE OF SIDEWAYS QUERY EVALUATION (Extended Abstract) 1986 PODS 0.00012406675
Previous Page 1 / 1 Next

Semantically Similar Papers