Skip to main content
SpringerLink
Log in

A Fixpoint Semantics for Reasoning about Finite Failure

  • Conference paper
Logic for Programming and Automated Reasoning (LPAR 1999)

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

Abstract

Our aim is to define a new fixpoint semantics which correctly models finite failure. In order to achieve this goal a new fixpoint operator is derived from a “suitable” concrete semantics by defining a Galois insertion modeling finite failure. The corresponding abstract fixpoint semantics correctly models finite failure and is and-compositional.

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. K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495–574. Elsevier and The MIT Press, 1990.

    Google Scholar 

  2. K. R. Apt and M. H. van Emden. Contributions to the theory of logic programming. Journal of the ACM, 29(3):841–862, 1982.

    Article  MATH  Google Scholar 

  3. A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: Theory and applications. Journal of Logic Programming, 19–20:149–197, 1994.

    Article  MathSciNet  Google Scholar 

  4. M. Comini and M. C. Meo. Compositionality properties of SLD-derivations. Theoretical Computer Science, 211(1–2):275–309, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. Fourth ACM Symp. Principles of Programming Languages, pages 238–252, 1977.

    Google Scholar 

  6. P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Proc. Sixth ACM Symp. Principles of Programming Languages, pages 269–282, 1979.

    Google Scholar 

  7. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science, 69(3):289–318, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Gori. Which semantics for finite failure. http://www.di.unipi.it/~sgori/Papers/, 1999.

  9. R. Gori and G. Levi. Finite failure is and-compositional. Journal of Logic and Computation, 7(6):753–776, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  10. R. Gori and G. Levi. On verification of finite failure. In Gopalan Nadathur, editor, Proc. Principles and Practice of Declarative Programming 1999, 1999.

    Google Scholar 

  11. J.-L. Lassez and M. J. Maher. Closures and Fairness in the Semantics of Programming Logic. Theoretical Computer Science, 29:167–184, 1984.

    Article  MathSciNet  Google Scholar 

  12. G. Levi, M. Martelli, and C. Palamidessi. Failure and success made symmetric. In S. K. Debray and M. Hermenegildo, editors, Proc. North American Conf. on Logic Programming’90, pages 3–22. The MIT Press, 1990.

    Google Scholar 

  13. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987. Second edition.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Roberta Gori

Authors
  1. Roberta Gori
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Max-Planck-Institut für Informatik, Im Stadtwald, D-66123, Saarbrücken, Germany

    Harald Ganzinger

  2. AT&T Labs Research, 180 Park Ave, Florham Park, NJ, 07932-0971, USA

    David McAllester

  3. Department of Computer Science, University of Manchester, Oxford Road, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gori, R. (1999). A Fixpoint Semantics for Reasoning about Finite Failure. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 1999. Lecture Notes in Computer Science(), vol 1705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48242-3_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-48242-3_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66492-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation