Resultants semantics for prolog

Journal of Logic and Computation

Volumn 6, Issue 4, 1996, Pages 491-521

  Gabbrielli, Maurizio ^a   Levi, Giorgio ^a   Meo, Maria Chiara ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Call patterns; Fixpoint semantics; Partial answers; Resultants

Indexed keywords

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

References (27)

1. K. R. Apt. Introduction to logic programming. In Handbook of Theoretical Computer Science, J. van Leeuwen, ed. Vol. B: Formal Models and Semantics, pp. 495-574. Elsevier, Amsterdam and The MIT Press, Cambridge, MA, 1990.
2. R. Barbuti, M. Codish, R. Giacobazzi and M. Maher. Oracle Semantics for PROLOG. In Algebraic and Logic Programming. Proceedings of the Third International Conference, H. Kirchner and G. Levi, eds. Vol. 632 of Lecture Notes in Computer Science, pp. 100-114. Springer-Verlag, Berlin, 1992.
3. M. Bergère, G. Ferrand and J. Réty. Independence of the Computation Rule for SLD-Resolution with Delay. Technical Report INRIA RR-LIFO-93-9, 1993.
4. R. N. Bol, K. R. Apt and J. W. Klop. An analysis of loop checking mechanisms for logic programs. Theoretical Computer Science, 86, 35-79, 1991.
5. A. Bossi, M. Bugliesi and M. Fabris. Fixpoint semantics for PROLOG. In Proceedings of the Tenth International Conference on Loigic Programming, D. S. Warren, ed. pp. 374-389. The MIT Press, Cambridge, MA, 1993.
6. 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.
7. A. Bossi, M. Gabbrielli, G. Levi and M. C Meo. A compositional semantics for logic programs. Theoretical Computer Science, 122, 3-47, 1994.
8. K. L. Clark. Predicate logic as a computational formalism. Res. Report DOC 79/59, Imperial College, Department of Computing, London, 1979.
9. M. Comini and G. Levi. An algebraic theory of observables. In Proceedings of the International Symposium on Uigic Programming, M. Bruynooghe, ed. pp. 172-186. The MIT Press, Cambridge, MA, 1994.
10. S. K. Debray. Formal bases for dataflow analysis of logic programs. In Advances in Logic Programming Theory, G. Levi, ed. Clarendon Press, Oxford, 1994.
11. E. Eder. Properties of substitutions and unifications. Journal of Symbolic Computation, 1, 31-46, 1985.
12. S. Etalle and M. Gabbrielli. A transformation system for modular CLP programs. In Proceedings of the Twelfth International Conference on Logic Programming, L. Sterling, ed. pp. 681-695. The MIT Press, Cambridge, MA, 1995.
13. 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.
14. R. Giacobazzi. On the collecting semantics of logic programs. In Proceedings of the Post-ICLP 94 Workshop on Verification and Analysis of Logic Languages, M. Gabbrielli and F. de Boer, eds. pp. 159-174. 1994.
15. M. Gabbrielli, G. Levi and M. C. Meo. Observational equivalences for logic programs. In Proceedings of the Joint International Conference and Symposium on Logic Programming, K. Apt, ed. pp. 131-145. The MIT Press, Cambridge, MA, 1992.
16. M. Gabbrielli, G. Levi and M. C. Meo. Observable behaviours and equivalences of logic programs. To appear in Information and Computation, 1995.
17. M. Gabbrielli and M. C. Meo. Fixpoint semantics for partial computed answer substitutions and call patterns. In Algebraic and Logic Programming, Proceedings of the Third International Conference, H. Kirchner and G. Levi, eds. Vol. 632 of Lecture Notes in Computer Science, pp. 84-99. Springer-Verlag, Berlin, 1992.
18. H. Gaifman and E. Shapiro. Fully abstract compositional semantics for logic programs. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pp. 134-142. ACM, 1989.
19. H. J. Komorowski. A Specification of an Abstract Prolog Machine and Its Application to Partial Evaluation. PhD thesis, Linköping University, Sweden, 1981. Linköping Studies in Science and Technology Dissertations 69.
20. 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.
21. J. W. Lloyd. Foundations of Logic Programming. 2nd edn. Springer-Verlag, Berlin, 1987.
22. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. Journal of Logic Programming, 11, 217-242, 1991.
23. C. Palamidessi. Algebraic properties of idempotent substitutions. In Proceedings of the 17th International Colloquium on Automata, Languages and Programming, M. S. Paterson, ed. Vol. 443 of Lecture Notes in Computer Science, pp. 386-399. Springer-Verlag, Berlin, 1990.
24. J. Shoenfield. Mathematical Logic. Addison-Wesley, Reading, MA, 1967.
25. H. Tamaki and T. Sato. Unfold/fold transformations of logic programs. In Proceedings of the Second International Conference on Logic Programming, Sten-Åke Tärnlund, ed. pp. 127-139. 1984.
26. L. Vieille. Recursive query processing: the power of logic. Theoretical Computer Science, 69, 1-53, 1989.
27. D. A. Wolfram, M. J. Maher and J.-L. Lassez. A unified treatment of resolution strategies for logic programs. In Proceedings of the Second International Conference on Logic Programming, Sten-Åke Tämlund, ed. pp. 263-276, 1984.