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
- 1. Alexander Brodsky (Hebrew University)
- 2. Yehoshua Sagiv (Hebrew University)
BibTeX Citation
@inproceedings{brodsky_pods89,
address = {New York, NY, USA},
series = {{PODS} '89},
title = {{Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/73721.73741},
doi = {10.1145/73721.73741},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Brodsky, Alexander and Sagiv, Yehoshua},
year = {1989}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 889 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00013398105 |
| 1,314 | Independence of Logic Database Queries and Updates | 1990 | PODS | 0.00011182427 |
| 1,714 | Modular Stratification and Magic Sets for DATALOG Programs with Negation | 1990 | PODS | 9.9404301e-05 |
| 3,824 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 7.0919497e-05 |
| 5,046 | Toward Practical Constraint Databases | 1993 | VLDB | 6.3879316e-05 |
| 7,454 | Modular Acyclicity and Tail Recursion in Logic Programs | 1991 | PODS | 5.6128072e-05 |
| 7,824 | Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract) | 1991 | PODS | 5.5368828e-05 |
| 12,991 | Structural Totality and Constraint Stratification | 1995 | PODS | 5.093636e-05 |
| 13,018 | Constraints among Argument Sizes in Logic Programs (Extended Abstract) | 1994 | PODS | 5.093636e-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,498 | Safety of Recursive Horn Clauses With Infinite Relations | 1987 | PODS | 0.00010567892 |
| 3,025 | An Axiomatic Approach to Deciding Query Safety in Deductive Databases | 1988 | PODS | 7.8386928e-05 |
| 3,355 | A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract) | 1988 | SIGMOD | 7.4912272e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,630 | On the Decidability of Query Containment under Constraints | 1998 | PODS |
| 2 | 9,093 | Efficiently Ordering Subgoals with Access Constraints [Extended Abstract] | 2006 | PODS |
| 3 | 6,221 | Well-Founded Semantics for Extended Datalog and Ontological Reasoning | 2013 | PODS |
| 4 | 7,886 | Polynomial-time program transformations in deductive databases | 1990 | PODS |
| 5 | 633 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 6 | 6,209 | On Datalog vs. Polynomial Time | 1991 | PODS |
| 7 | 7,972 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS |
| 8 | 3,824 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS |
| 9 | 6,613 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 10 | 6,077 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS |