Finite failure is and-compositional

Journal of Logic and Computation

Volumn 7, Issue 6, 1997, Pages 753-776

  Gori, Roberta ^a   Levi, Giorgio ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Finite failure; Logic programming

Indexed keywords

SEMANTICS;

ABSTRACT SEMANTICS; FINITE FAILURE;

LOGIC PROGRAMMING;

EID: 0011156298     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/7.6.753     Document Type: Article

References (18)

1. K. R. Apt. Introduction to logic programming. In Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, J. van Leeuwen, ed. pp. 495-574. Elsevier, Amsterdam and The MIT Press, Cambridge, MA, 1990.
2. K. R. Apt and D. Pedreschi. Studies in pure prolog: Termination. In Computational Logic, J. W. Lloyd, ed. pp. 150-176. Springer-Verlag, Berlin, 1990.
3. K. R. Apt and D. Pedreschi. Reasoning about termination of pure PROLOG programs. Information and Computation, 106, 109-157, 1993.
4. A. Bossi and N. Cocco. Basic transformation operations for logic programs which preserve computed answer substitutions of logic programs. Journal of Logic Programming, 16, 47-87, 1993.
5. 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.
6. M. Comini, G. Levi and G. Vitiello. Declarative diagnosis revisited. In Proceedings of the 1995 International Symposium on Logic Programming, J. Lloyd, ed. pp. 275-287. The MIT Press, Cambridge, MA, 1995.
7. M. Falaschi, G. Levi, M. Martelli and C. Palamidessi. Declarative modeling of the operational behavior of logic languages. Theoretical Computer Science, 69, 289-318, 1989.
8. G. Ferrand. Error diagnosis in logic programming, an adaptation of E. Y. Shapiro's method. Journal of Logic Programming, 4, 177-198, 1987.
9. M. Gabbrielli. The Semantics of Logic Programming as a Programming Language. PhD thesis, Dipartimento di Informatica, Università di Pisa, 1993.
10. M. Gabbrielli, G. Levi and M. C. Meo. Observable behaviors and equivalences of logic programs. Information and Computation, 122, 1-29, 1995.
11. M. Gabbrielli, G. Levi and M. C. Meo. Resultants semantics for PROLOG. Journal of Logic and Computation, 6, 491-521, 1996.
12. W. G. Golson. Toward a declarative semantics for infinite objects in logic programming. Journal of Logic Programming, 5, 151-164, 1988.
13. R. Gori. Una semantica corretta e composizionale per l'osservabile fallimento finito. Master's thesis, Dipartimento di Informatica, Università di Pisa, 1994 (in Italian).
14. J.-L. Lassez, M. J. Maher and K. Marriott. Unification Revisited. In Foundations of Deductive Databases and Logic Programming, J. Minker, ed. pp. 587-625. Morgan Kaufmann, Los Altos, CA, 1988.
15. G. Levi, M. Martelli and C. Palamidessi. Failure and success made symmetric. In Proceedings of the North American Conference on Logic Programming '90, S. K. Debray and M. Hermenegildo, eds. pp. 3-22. The MIT Press, Cambridge, MA, 1990.
16. J. W. Lloyd. Foundations of Logic Programming. Second edition. Springer-Verlag, Berlin, 1987.
17. D. Pedreschi and S. Ruggieri. Termination is language-independent. In GULP-PRODE'94, Proceedings of the 1994 Joint Conference on Declarative Programming, M. Alpuente, R. Barbuti and I. Ramos, eds. pp. 418-433. Universitat Politecnica de Valencia, Valencia, 1994.
18. E. Y. Shapiro. Algorithmic program debugging. In Proceedings of the Ninth Annual ACM Symposium on Principles of Programming Languages, pp. 412-531. ACM Press, 1982.