Skip to main content
SpringerLink
Log in

An Effective Bottom-Up Semantics for First-Order Linear Logic Programs

  • Conference paper
  • First Online:
Functional and Logic Programming (FLOPS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2024))

Included in the following conference series:

Abstract

We study the connection between algorithmic techniques for symbolic model checking [ACJT96,FS98,AJ99], and declarative and op- erational aspects of linear logic programming [And92,AP90]. Specifically, we show that the construction used to decide verification problems for Timed Petri Nets [AJ99] can be used to define a new fixpoint semantics for the fragment of linear logic called LO [AP90]. The fixpoint semantics is based on an effective T P operator. As an alternative to traditional top-down approaches [And92,AP90,APC93], the effective fixpoint operator can be used to define a bottom-up evaluation procedure for first-order linear logic programs.

Acknowledgments

The authors would like to thank Iliano Cervesato and the anonymous reviewers for their useful comments and suggestions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. A. Abdulla, K. Cerāns, B. Jonsson and Y.-K. Tsay. General Decidability Theorems for Infinite-State Systems. In Proc. of LICS 96, pages 313–321, 1996.

    Google Scholar 

  2. P. A. Abdulla, and B. Jonsson. Ensuring Completeness of Symbolic Verification Methods for Infinite-State Systems. To appear in Theoretical Computer Science, 1999.

    Google Scholar 

  3. P. A. Abdulla, and A. Nylen. Better is Better than Well: On Efficient Verification of Infinite-State Systems. In Proc. LICS’2000, pages 132–140, 2000.

    Google Scholar 

  4. J. M. Andreoli. Logic Programming with Focusing proofs in Linear Logic. Journal of Logic and Computation, 2(3):297–347, 1992.

    Article  MathSciNet  Google Scholar 

  5. J. M. Andreoli and R. Pareschi. Linear Objects: Logical Processes with Built-In Inheritance. In Proc. of ICLP’90, pages 495–510, 1990.

    Google Scholar 

  6. J. M. Andreoli, R. Pareschi and T. Castagnetti. Abstract Interpretation of Linear Logic Programming. In Proc. of ILPS’93, pages 295–314, 1993.

    Google Scholar 

  7. M. Bozzano, G. Delzanno, and M. Martelli. A Bottom-up semantics for Linear Logic Programs. In Proc. of PPDP 2000, pages 92–102, 2000.

    Google Scholar 

  8. M. Bozzano, G. Delzanno, and M. Martelli. An Effective Bottom-Up Semantics for First-Order Linear Logic Programs and its Relationship with Decidability Results for Timed Petri Nets. Technical Report, DISI, UniVersità di Genova, Decemeber 2000.

    Google Scholar 

  9. I. Cervesato. Petri Nets and Linear Logic: a Case Study for Logic Programming. In Proc. of GULP-PRODE’95, pages 313–318, 1995.

    Google Scholar 

  10. G. Delzanno and A. Podelski. Model Checking in CLP. In Proc. of TACAS’99, LNCS 1579, pages 223–239, 1999.

    Google Scholar 

  11. M. Falaschi and G. Levi and M. Martelli and C. Palamidessi. A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs. Information and Computation, 102(1):86–113, 1993.

    Article  MathSciNet  Google Scholar 

  12. A. Finkel and P. Schnoebelen. Well-structured Transition Systems Everywhere! Technical Report LSV-98-4, Laboratoire Spécification et Vérification, ENS Cachan, 1998. To appear in Theoretical Computer Science, 1999.

    MATH  Google Scholar 

  13. L. Fribourg. Constraint logic programming applied to model checking. In Proc. LOPSTR’99, pages 31–42, 2000.

    Google Scholar 

  14. M. Gabbrielli, M. G. Dore and G. Levi. Observable Semantics for Constraint Logic Programs. Journal of Logic and Computation, 5(2): 133–171, 1995.

    Article  MathSciNet  Google Scholar 

  15. J. Y. Girard. Linear Logic. Theoretical Computer Science, 50:1–102, 1987.

    Article  MathSciNet  Google Scholar 

  16. J. S. Hodas and D. Miller. Logic Programming in a Fragment of Intuitionistic Linear Logic. Information and Computation, 110(2):327–365, 1994.

    Article  MathSciNet  Google Scholar 

  17. J. Harland and M. Winiko. Making Logic Programs Reactive. In Proc. of JICSLP’98 Workshop Dynamics’98, pages 43–58, 1998.

    Google Scholar 

  18. J. Jaffar and M. J. Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, 19-20:503–582, 1994.

    Article  MathSciNet  Google Scholar 

  19. M. I. Kanovich. Petri Nets, Horn Programs, Linear Logic, and Vector Games. In Proc TACS. ’94, pages 642–666, 1994.

    Google Scholar 

  20. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, E. Shahar. Symbolic Model Checking with Rich Assertional Languages. In Proc. CAV ’97, pages 424–435, 1997.

    Google Scholar 

  21. A. P. Kopylov. Propositional Linear Logic with Weakening is Decidable. In Proc. LICS 95, pages 496–504, 1995.

    Google Scholar 

  22. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.

    Google Scholar 

  23. N. Martì-Oliet, J. Meseguer. From Petri Nets to Linear Logic. Mathematcal Structures in Computer Science 1(1):69–101, 1991.

    Article  MathSciNet  Google Scholar 

  24. D. Miller. Forum: A Multiple-Conclusion Specification Logic. Theoretical Computer Science, 165(1):201–232, 1996.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Scienze dell’Informazione, Universitá di Genova, Via Dodecaneso 35, 16146, Genova, Italy

    Marco Bozzano, Giorgio Delzanno & Maurizio Martelli

Authors
  1. Marco Bozzano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giorgio Delzanno
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maurizio Martelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Wirtschaftsinformatik, WestfälischeWilhelms-Universität Münster, Steinfurter Straße 109, 48149, Münster, Germany

    Herbert Kuchen

  2. Department of Information and Computer Science, Waseda University, 4-1, Okubo 3-chome, Shinjuku-ku, Tokyo, 169-8555, Japan

    Kazunori Ueda

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bozzano, M., Delzanno, G., Martelli, M. (2001). An Effective Bottom-Up Semantics for First-Order Linear Logic Programs. In: Kuchen, H., Ueda, K. (eds) Functional and Logic Programming. FLOPS 2001. Lecture Notes in Computer Science, vol 2024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44716-4_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-44716-4_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41739-2

  • Online ISBN: 978-3-540-44716-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation