Database Paper Browser

Back to papers

Minimum and Maximum Predicates in Logic Programming

Summary: Introduce min/max predicates with first-order semantics via rules with negation to declaratively express optimization problems (e.g., shortest path). Under monotonicity they ensure a total well-founded model computable via a greedy fixpoint and a rewrite that pushes min/max into recursion, yielding Dijkstra-like evaluation. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
933
Venue
PODS
Year
1991
Pagerank
7.0861064e-05
Overall Rank
3,446 | 76.03%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

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
445 The Magic of Duplicates and Aggregates 1990 VLDB 0.0002294367
1,205 The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract) 1989 PODS 0.00013285448
2,544 Aggregation and Relevance in Deductive Databases 1991 VLDB 8.5730083e-05
4,757 Stable Models and Non-Determinism in Logic Programs with Negation 1990 PODS 5.9434944e-05
Previous Page 1 / 1 Next

Semantically Similar Papers