Inference of Inequality Constraints in Logic Programs.

@inproceedings{DBLP:conf/pods/BrodskyS91,
  author    = {Alexander Brodsky and
               Yehoshua Sagiv},
  title     = {Inference of Inequality Constraints in Logic Programs},
  booktitle = {Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on
               Principles of Database Systems, May 29-31, 1991, Denver, Colorado},
  publisher = {ACM Press},
  year      = {1991},
  isbn      = {0-89791-430-9},
  pages     = {227-240},
  ee        = {http://doi.acm.org/10.1145/113413.113434, db/conf/pods/BrodskyS91.html},
  crossref  = {DBLP:conf/pods/91},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• UNIX/LINUX/Mac: use mount point /pods8298/... or /cdrom/...

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• UNIX/LINUX/Mac: use mount point /aDVD1/... or /cdrom/...

Printed Edition

Online Edition: ACM Digital Library

References

[A*89]

Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman: On the Convergence of Query Evaluation. J. Comput. Syst. Sci. 38(2): 341-359(1989) BibTeX

[AP90]

...

[BS89a]

Alexander Brodsky, Yehoshua Sagiv: Inference of Monotonicity Constraints in Datalog Programs. PODS 1989: 190-199 BibTeX

[BS89b]

Alexander Brodsky, Yehoshua Sagiv: On Termination of Datalog Programs. DOOD 1989: 47-64 BibTeX

[KiL88]

Michael Kifer, Eliezer L. Lozinskii: SYGRAF: Implementing Logic Programs in a Database Style. IEEE Trans. Software Eng. 14(7): 922-935(1988) BibTeX

[KiRS88]

Michael Kifer, Raghu Ramakrishnan, Abraham Silberschatz: An Axiomatic Approach to Deciding Query Safety in Deductive Databases. PODS 1988: 52-60 BibTeX

[KrRS88]

Ravi Krishnamurthy, Raghu Ramakrishnan, Oded Shmueli: A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract). SIGMOD Conference 1988: 154-163 BibTeX

[M*86]

Katherine A. Morris, Jeffrey D. Ullman, Allen Van Gelder: Design Overview of the NAIL! System. ICLP 1986: 554-568 BibTeX

[M*87]

Katherine A. Morris, Jeffrey F. Naughton, Yatin P. Saraiya, Jeffrey D. Ullman, Allen Van Gelder: YAWN! (Yet Another Window on NAIL!). IEEE Data Eng. Bull. 10(4): 28-43(1987) BibTeX

[NT88]

Shamim A. Naqvi, Shalom Tsur: A Logical Language for Data and Knowledge Bases. Computer Science Press 1989, ISBN 0-7167-8200-6
BibTeX

[Pr77]

...

[Pl90a]

Lutz Plümer: Termination Proofs for Logic Programs Based on Predicate Inequalities. ICLP 1990: 634-648 BibTeX

[Pl90b]

...

[RBS87]

Raghu Ramakrishnan, François Bancilhon, Abraham Silberschatz: Safety of Recursive Horn Clauses With Infinite Relations. PODS 1987: 328-339 BibTeX

[RH80]

Daniel J. Rosenkrantz, Harry B. Hunt III: Processing Conjunctive Predicates and Queries. VLDB 1980: 64-72 BibTeX

[SV89]

Yehoshua Sagiv, Moshe Y. Vardi: Safety of Datalog Queries over Infinite Databases. PODS 1989: 160-171 BibTeX

[Sh87]

Oded Shmueli: Decidability and Expressiveness of Logic Queries. PODS 1987: 237-249 BibTeX

[SV91]

Kirack Sohn, Allen Van Gelder: Termination Detection in Logic Programs using Argument Sizes. PODS 1991: 216-226 BibTeX

[UV88]

Jeffrey D. Ullman, Allen Van Gelder: Efficient tests for top-down termination of logical rules. J. ACM 35(2): 345-373(1988) BibTeX

[V90]

Allen Van Gelder: Deriving Constraints Among Argument Sizes in Logic Programs. PODS 1990: 47-60 BibTeX

[Z88]

Carlo Zaniolo: Design and Implementation of a Logic Based Language for Data Intensive Applications. ICLP/SLP 1988: 1666-1687 BibTeX

Referenced by

1. Paris C. Kanellakis: Constraint Programming and Database Languages: A Tutorial. PODS 1995: 46-53
2. Kirack Sohn: Constraints among Argument Sizes in Logic Programs. PODS 1994: 68-74
3. Divesh Srivastava, Raghu Ramakrishnan: Pushing Constraint Selections. PODS 1992: 301-315
4. Alon Y. Levy, Yehoshua Sagiv: Constraints and Redundancy in Datalog. PODS 1992: 67-80
5. Kirack Sohn, Allen Van Gelder: Termination Detection in Logic Programs using Argument Sizes. PODS 1991: 216-226