A fixpoint semantics for reasoning about finite failure

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1705 LNAI, Issue , 1999, Pages 238-257

  Gori, Roberta ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Abstract interpretation; Finite failure; Logic programming

Indexed keywords

LOGIC PROGRAMMING; SEMANTICS;

ABSTRACT INTERPRETATIONS; FINITE FAILURE; FIX-POINT SEMANTICS; FIXPOINTS;

COMPUTER CIRCUITS;

EID: 0013405056     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48242-3_15     Document Type: Conference Paper

References (13)

1. K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Form2d Models and Semantics, pages 495-574. Elsevier and The MIT Press, 1990.
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.
3. A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: Theory and appUcations. Journal of Logic Programming, 19-20:149-197, 1994.
4. M. Comini and M. C. Meo. Compositionality properties of SLD-derivations. theoretical Computer Science, 211(l-2):275-309, 1999.
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.
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.
7. M. Falaschi, G. Levi, M. Meurtelli, and C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science, 69(3):289-318, 1989.
8. R. Gori. Which semantics for finite failure. http://www.di.unipi.it/ ~gori/Papers/,1999.
9. R. Gori and G. Levi. Finite failure is and-compositional. Journal of Logic and Computation, 7(6):753-776, 1997.
10. R. Gori and G. Levi. On verification of finite fEtilure. In Gopalan Nadathur, editor, Proc. Principles and Practice of Declarative Programming 1999, 1999.
11. J.-L. Lassez and M. J. Maher. Closures and Fairness in the Semantics of Programming Logic. Theoretical Computer Science, 29:167-184, 1984.
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.
13. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987. Second edition.