Skip to main content
SpringerLink
Log in

A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

We present a method for characterizing the least fixed-points of a certain class of Datalog programs in Presburger arithmetic. The method consists in applying a set of rules that transform general computation paths into “canonical” ones. We use the method for treating the problem of reachability in the field of Petri nets, thus relating some unconnected results and extending them in several directions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli & G. Franceschinis. (1995). Modelling with Generalized Stochastic Petri Nets. John Wiley & Sons, Chichester.

    Google Scholar 

  2. M. Baudinet, M. Niezette & P. Wolper. (1991). On the Representation of Infinite Temporal Data Queries. Proc. 10th ACM Symp. on Principles of Database Systems, pages 280-290.

  3. G. Berthelot. (1986). Transformations and Decompositions of Nets. Advances in Petri Nets, LNCS 254, pages 359-376, Springer-Verlag.

    Google Scholar 

  4. A. Boudet & H. Comon. (1996). Diophantine Equations, Presburger Arithmetic and Finite Automata. Proc. 21st Intl. Colloquium on Trees in Algebra and Programming, LNCS 1059, pages 30-43, Springer-Verlag.

    Google Scholar 

  5. G.W. Brams. (1983). R´ eseaux de Petri: Th´ eorie et Pratique. Masson, Paris.

  6. J. Chomicki & T. Imielinski. (1988). Temporal Deductive Databases and Infinite Objects. Proc. 7th ACM Symp. on Principles of Database Systems, Austin, pages 61-81.

  7. S. Christensen. (1993). Decidability and Decompositionin Process Algebras. Ph.D. Thesis,University of Edinburgh, CST-105-93.

  8. M. Clausen & A. Fortenbacher. (1989). Efficient Solution of Linear Diophantine Equations. J. Symbolic Computation 8:201-216.

    Google Scholar 

  9. P. Cousot & N. Halbwachs. (1978). Automatic Discovery of Linear Restraints among Variables of a Program. Conference Record 5th ACM Symp. on Principles of Programming Languages, Tucson, pages 84-96.

  10. J. Esparza & M. Nielsen. (1994). Decidability Issues for Petri Nets. Bulletin of the EATCS, Number 52.

  11. J. Esparza. (1995). Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. Proc. of Fundamentals of Computer Theory '95, LNCS 965, pages 221-232, Springer-Verlag.

    Google Scholar 

  12. L. Fribourg & M. Veloso Peixoto. (1994). Bottom-up Evaluation of Datalog Programs with Incremental Arguments and Linear Arithmetic Constraints. Proc. Post-ILPS'94 Workshop on Constraints and Databases, Ithaca, N.Y., pages 109-125.

  13. L. Fribourg & H. Ols´en. (1995). Datalog Programs with Arithmetical Constraints: Hierarchic, Periodic an Spiralling Least Fixpoints. Technical Report LIENS-95-26, Ecole Normale Sup´ erieure, Paris.

    Google Scholar 

  14. L. Fribourg & H. Ols´en. (1997). Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic. Proc. 8th Intl. Conf. on Concurrency Theory, Warsaw, Poland, LNCS, Springer-Verlag.

    Google Scholar 

  15. A. Van Gelder. (1990). Deriving Constraints among Argument Sizes in Logic Programs. Proc. 9th ACM Symp. on Principles of Database Systems, Nashville, pages 47-60.

  16. S. Ginsburg & E.H. Spanier. (1966). Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics 16:285-296.

    Google Scholar 

  17. N. Halbwachs. (1993). Delay Analysis in Synchronous Programs. Proc. Computer Aided Verification, LNCS 697, pages 333-346, Springer-Verlag.

    Google Scholar 

  18. A.R. Helm. (1989). On the Detection and Elimination of Redundant Derivations during Bottom-up Execution. Proc. North American Conference on Logic Programming, Cleveland, Ohio, pages 945-961.

  19. J. Hopcroft & J.-J. Pansiot. (1979). On the Reachability Problem for 5-dimensional Vector Addition Systems. Theoretical Computer Science 8:135-159.

    Google Scholar 

  20. J. Jaffar & J.L. Lassez. (1987). Constraint Logic Programming. Proc.14th ACM Symp. on Principles of Programming Languages, pages 111-119.

  21. F. Kabanza, J.M. Stevenne & P. Wolper. (1990). Handling Infinite Temporal Data. Proc. 9th ACM Symp. on Principles of Database Systems, Nashville, pages 392-403.

  22. P. Kanellakis, G. Kuper & P. Revesz. (1990). Constraint Query Languages. Internal Report. (Short version in Proc. 9th ACM Symp. on Principles of Database Systems, Nashville, pages 299-313).

  23. J.-L. Lassez & M.J. Maher. (1983). The Denotational Semantics of Horn Clauses As a Production System. Proc. AAAI-83, Washington D.C., pages 229-231.

  24. D.W. Loveland. (1978). Automated Theorem Proving: A Logical Basis. North-Holland, Amsterdam.

    Google Scholar 

  25. M.J. Maher. (1988). Equivalences of Logic Programs. In J. Minker, editor, Foundations of Deductive Databases and of Logic Programming, pages 627-658. Morgan Kaufmann Publishers.

  26. M.J. Maher. (1993). A Logic Programming View of CLP. Proc. 10th Intl. Conf. on Logic Programming, Budapest, pages 737-753.

  27. S. Melzer & J. Esparza. (1995). Checking System Properties via Integer Programming. SFB-Bericht 342/13/95A, Technische Universitaet Muenchen. (See also: proceedings of ESOP '96).

  28. J.F. Naughton & Y. Sagiv. (1987). A Decidable Class of Bounded Recursions. Proc. 6th ACM Symp. on Principles of Database Systems, San Diego, pages 171-180.

  29. N.J. Nilsson. (1982). Principles of Artificial Intelligence. Springer-Verlag.

  30. J.L. Peterson. (1981). Petri Net Theory and the Modeling of Systems. Prentice-Hall.

  31. L. Pl¨ umer. (1990) Termination Proofs for Logic Programs based on Predicate Inequalities. Proc. 7th Intl. Conf. on Logic Programming, Jerusalem, pages 634-648.

  32. R. Ramakrishnan, Y. Sagiv, J.D. Ulmann & M.Y. Vardi. (1989). Proof-Tree Transformation Theorems and their Applications. Proc. 8th ACM Symp. on Principles of Database Systems, Philadelphia, pages 172-181.

  33. P. Revesz. (1990). AClosed Form for Datalog Queries with Integer Order. Proc. 3rd International Conference on Database Theory, Paris, pages 187-201.

  34. D. Srivastava & R. Ramakrishnan. (1992). Pushing Constraints Selections. Proc. 11th ACM Symp. on Principles of Database Systems, San Diego, pages 301-315.

  35. H. Tamaki & T. Sato. (1984). Unfold/fold Transformations of Logic Programs. Proc. 2nd Intl. Conf. on Logic Programming, Uppsala, pages 127-138.

  36. K. Verschaetse & D. De Schreye. (1991). Deriving Termination Proofs for Logic Programs using Abstract Procedures. Proc. 8th Intl. Conf. on Logic Programming, Paris, pages 301-315.

  37. L. Vieille. (1989). Recursive Query Processing: The Power of Logic. Theoretical Computer Science 69:1-53.

    Google Scholar 

  38. H.-C. Yen. (1996). On the Regularity of Petri Net Languages. Information and Computation 124:168-181.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ecole Normale Supérieure Cachan and CNRS, 61 av. Président Wilson, 94235, Cachan, France

    Laurent Fribourg

  2. IDA, Linköping University, S-58183, Linköping, Sweden

    Hans Olsén

Authors
  1. Laurent Fribourg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Olsén
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fribourg, L., Olsén, H. A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters. Constraints 2, 305–335 (1997). https://doi.org/10.1023/A:1009747629591

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009747629591

Search

Navigation