Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract)
Summary: Infers monotonicity constraints (argumentwise partial-order inequalities) in Datalog: given EDB predicates satisfying a domain partial order, computes all monotonicity/equality-disjunction constraints entailed for IDB relations. Gives complete algorithms and complexity—EXPTIME-complete in general, PSPACE-complete for linear programs. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 620 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00019005954 |
| 1,189 | Independence of Logic Database Queries and Updates | 1990 | PODS | 0.00013441514 |
| 1,381 | Modular Stratification and Magic Sets for DATALOG Programs with Negation | 1990 | PODS | 0.00012283951 |
| 3,435 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.0966834e-05 |
| 4,793 | Toward Practical Constraint Databases | 1993 | VLDB | 5.9164359e-05 |
| 6,876 | Modular Acyclicity and Tail Recursion in Logic Programs | 1991 | PODS | 4.8977465e-05 |
| 7,266 | Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract) | 1991 | PODS | 4.782728e-05 |
| 12,797 | Structural Totality and Constraint Stratification | 1995 | PODS | 4.1945683e-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 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,051 | Safety of Recursive Horn Clauses With Infinite Relations | 1987 | PODS | 0.00014440736 |
| 2,786 | An Axiomatic Approach to Deciding Query Safety in Deductive Databases | 1988 | PODS | 8.1283801e-05 |
| 3,010 | A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract) | 1988 | SIGMOD | 7.7205569e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,490 | On the Decidability of Query Containment under Constraints | 1998 | PODS | 0.00011699154 |
| 8,937 | Efficiently Ordering Subgoals with Access Constraints [Extended Abstract] | 2006 | PODS | 4.427232e-05 |
| 4,298 | Well-Founded Semantics for Extended Datalog and Ontological Reasoning | 2013 | PODS | 6.2885419e-05 |
| 7,598 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.7004867e-05 |
| 581 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS | 0.00019767772 |
| 6,031 | On Datalog vs. Polynomial Time | 1991 | PODS | 5.2415551e-05 |
| 7,591 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS | 4.702934e-05 |
| 3,435 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.0966834e-05 |
| 6,236 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS | 5.1436959e-05 |
| 4,136 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS | 6.4188795e-05 |