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 |
|---|---|---|---|---|
| 618 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00018990567 |
| 1,189 | Independence of Logic Database Queries and Updates | 1990 | PODS | 0.0001342924 |
| 1,381 | Modular Stratification and Magic Sets for DATALOG Programs with Negation | 1990 | PODS | 0.00012271947 |
| 3,440 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.0897313e-05 |
| 4,793 | Toward Practical Constraint Databases | 1993 | VLDB | 5.9107617e-05 |
| 6,881 | Modular Acyclicity and Tail Recursion in Logic Programs | 1991 | PODS | 4.8929836e-05 |
| 7,265 | Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract) | 1991 | PODS | 4.7781007e-05 |
| 12,806 | Structural Totality and Constraint Stratification | 1995 | PODS | 4.1905499e-05 |
| 12,833 | Constraints among Argument Sizes in Logic Programs (Extended Abstract) | 1994 | PODS | 4.1905499e-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,049 | Safety of Recursive Horn Clauses With Infinite Relations | 1987 | PODS | 0.00014426218 |
| 2,790 | An Axiomatic Approach to Deciding Query Safety in Deductive Databases | 1988 | PODS | 8.1203289e-05 |
| 3,012 | A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract) | 1988 | SIGMOD | 7.7129076e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,489 | On the Decidability of Query Containment under Constraints | 1998 | PODS | 0.00011687823 |
| 8,941 | Efficiently Ordering Subgoals with Access Constraints [Extended Abstract] | 2006 | PODS | 4.4229886e-05 |
| 4,291 | Well-Founded Semantics for Extended Datalog and Ontological Reasoning | 2013 | PODS | 6.2824978e-05 |
| 7,603 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.6959912e-05 |
| 582 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS | 0.00019753367 |
| 6,035 | On Datalog vs. Polynomial Time | 1991 | PODS | 5.2365238e-05 |
| 7,594 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS | 4.6983854e-05 |
| 3,440 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.0897313e-05 |
| 6,234 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS | 5.1387584e-05 |
| 4,138 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS | 6.4127061e-05 |