Skip to main content
SpringerLink
Log in

Bottom-up evaluation of Datalog programs with arithmetic constraints

  • Conference paper
  • First Online:
Automated Deduction — CADE-12 (CADE 1994)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 814))

Included in the following conference series:

  • 160 Accesses

Abstract

We consider a class of recursive logic programs over integers that are often met in Temporal Deductive Databases, or when proving termination of Prolog programs. We show that the least fixpoint associated with a program of this class is a linear arithmetic formula that can be generated by a refined process of bottom-up evaluation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. R. Apt, M. H. Van Emden. “Contributions to the Theory of Logic Programming”. J.ACM 29, 1982, pp. 841–862.

    Google Scholar 

  2. M. Baudinet. “Temporal Logic Programming is Complete and Expressive”. Proc. 16th ACM Symp. on Principles of Programming Languages, Austin, 1989, pp. 267–280.

    Google Scholar 

  3. R. S. Boyer and J. S. Moore. “Integrating Decision Procedures into Heuristic Theorem Provers: A Case of Linear Arithmetic”, Machine Intelligence 11, J. E. Hayes, D. Michie and J. Richards (eds.), Clarendon Press, Oxford, 1988, pp. 83–124.

    Google Scholar 

  4. M. Baudinet, M. Niezette and P. Wolper. “On the Representation of Infinite Temporal Data Queries”. Proc. 10th ACM Symp. on Principles of Database Systems, Denver, 1991, pp. 280–290.

    Google Scholar 

  5. F. Bancillon and R. Ramakrishnan. “An Amateur's Introduction to Recursive Query Processing Strategies”, Proc. ACM Conf. on Management of Data, Washington, 1986, pp. 16–52.

    Google Scholar 

  6. A. Brodsky and Y. Sagiv. “Inference of Inequality Constraints in Logic Programs”. Proc. 10th ACM Symp. on Principles of Database Systems, Denver, 1991, pp. 227–240.

    Google Scholar 

  7. P. Cousot and R. Cousot. “Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints”, Conference Record of the 4th ACM Symposium on Principles of Programming Languages, Los Angeles, 1977, pp. 238–252.

    Google Scholar 

  8. P. Cousot and N. Halbwachs. “Automatic Discovery of Linear Restraints among Variables of a Program”. Conference Record 5th ACM Symp. on Principles of Programming Languages, Tucson, 1978, pp. 84–96.

    Google Scholar 

  9. J. Chomicki and T. Imielinski. “Temporal Deductive Databases and Infinite Objects”. Proc. 7th ACM Symp. on Principles of Database Systems, Austin, 1988, pp. 61–81.

    Google Scholar 

  10. M. H. Van Emden and R. A. Kowalski. “The Semantics of Predicate Logic as a Programming Language”, J.ACM 23:4, 1976, pp. 733–742.

    Google Scholar 

  11. L. Fribourg. “Mixing List Recursion and Arithmetic”. Proc. 7th IEEE Symp. on Logic in Computer Science, Santa Cruz, 1992, pp. 419–429.

    Google Scholar 

  12. L. Fribourg and M. Veloso Peixoto. “Bottom-up Evaluation of Datalog Programs with Arithmetic Constraints”. Technical report, LIENS 92-13, June 1992.

    Google Scholar 

  13. L. Fribourg and M. Veloso Peixoto. “Concurrent Constraint Automata”. Technical report, LIENS 93–10, May 1993.

    Google Scholar 

  14. A. Van Gelder. “Deriving Constraints among Argument Sizes in Logic Programs”, Proc. 9th ACM Symp. on Principles of Database Systems, Nashville, 1990, pp. 47–60.

    Google Scholar 

  15. J. Jaffar and J.L. Lassez. “Constraint Logic Programming”, Proc. 14th ACM Symp. on Principles of Programming Languages, 1987, pp. 111–119.

    Google Scholar 

  16. G. Kuper. “On the Expressive Power of the Relational Calculus with Arithmetic Constraints”. Proc. 3rd International Conference on Database Theory, Paris, 1990, pp. 203–313.

    Google Scholar 

  17. P. Kanellakis, G. Kuper and P. Revesz. “Constraint Query Languages”. Proc. 9th ACM Symp. on Principles of Database Systems, Nashville, 1990, pp. 299–313.

    Google Scholar 

  18. D.B. Kemp and P.J. Stuckey. “Analysis Based Constraint Query Optimization”. Proc. 10th Intl. Conf. on Logic Programming, Budapest, The MIT Press, 1993, pp. 666–682.

    Google Scholar 

  19. F. Kabanza, J.M. Stevenne and P. Wolper. “Handling Infinite Temporal Data”. Proc. 9th ACM Symp. on Principles of Database Systems, Nashville, 1990, pp. 392–403.

    Google Scholar 

  20. J-L Lassez. “Querying Constraints”. Proc. 9th ACM Symp. on Principles of Database Systems, Nashville, 1990, pp. 288–298.

    Google Scholar 

  21. J-L Lassez. “Parametric Queries, linear constraints and variable elimination”. Proc. Conference on Design and Implementation of Symbolic Computer, LNCS 429, 1990, pp. 164–173.

    Google Scholar 

  22. J. Lloyd. “Foundations of Logic Programming”. Second Edition, Springer Verlag, Berlin, 1987.

    Google Scholar 

  23. A. Levy and Y. Sagiv. “Constraints and Redundancy in Datalog”. Proc. 11th ACM Symp. on Principles of Database Systems, San Diego, 1992, pp. 67–80.

    Google Scholar 

  24. R. Van der Meyden. “Reasoning with Recursive Relations: Negation, Inequality and Linear Order (Extended Abstract)”. Proc. ILPS Workshop on Deductive Databases, San Diego, 1991.

    Google Scholar 

  25. J. Misra and D. Gries. “Finding Repeated Elements”, Science of Computer Programming 2, 1982, pp. 143–152.

    Google Scholar 

  26. K. Marriot and P.J. Stuckey. “The 3 R's of Optimizing Constraint Logic Programs: Refinement, Removal and Reordering”. Proc. 20th ACM Symp. on Principles of Programming Languages, Charleston, 1993, pp. 334–344.

    Google Scholar 

  27. L. Plümer. “Termination Proofs for Logic Programs based on Predicate Inequalities”. Proc. 7th International Conference on Logic Programming, Jerusalem, 1990, pp. 634–648.

    Google Scholar 

  28. P. Revesz. “A Closed Form for Datalog Queries with Integer Order”. Proc. 3rd International Conference on Database Theory, Paris, 1990, pp. 187–201.

    Google Scholar 

  29. D. Srivastava. “Subsumption in Constraint Query Languages with Linear Arithmetic Constraints”. Proc. 2nd International Symp. on Artificial Intelligence and Mathematics, Fort Lauderdale, 1992.

    Google Scholar 

  30. D. Srivastava and R. Ramakrishnan. “Pushing Constraint Selections”. Proc. 11th ACM Symp. on Principles of Database Systems, San Diego, 1992, pp. 301–315.

    Google Scholar 

  31. J. D. Ullman and A. Van Gelder. “Efficient Test for Top-Down Termination”, J.ACM 35:2, 1988, pp. 345–373.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.E.N.S (URA 1327 CNRS), 45, rue d'Ulm, 75005, Paris, France

    Laurent Fribourg & Marcos Veloso Peixoto

Authors
  1. Laurent Fribourg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcos Veloso Peixoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alan Bundy

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fribourg, L., Peixoto, M.V. (1994). Bottom-up evaluation of Datalog programs with arithmetic constraints. In: Bundy, A. (eds) Automated Deduction — CADE-12. CADE 1994. Lecture Notes in Computer Science, vol 814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58156-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-58156-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58156-7

  • Online ISBN: 978-3-540-48467-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation