Simultaneous replacement in normal programs

Journal of Logic and Computation

Volumn 6, Issue 1, 1996, Pages 79-120

  Bossi, Annalisa ^a   Cocco, Nicoletta ^b   Etalle, Sandro ^a,c  

^a UNIVERSITY OF PADOVA   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^c CWI   (Netherlands)

Author keywords

Logic programming; Negation; Program transformation; Replacement; Semantics

Indexed keywords

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

References (20)

1. K. R. Apt. Introduction to logic programming. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, J. van Leeuwen, ed. Elsevier, Amsterdam and The MIT Press, Cambridge, MA, 1990.
2. K. R. Apt and M. Bezem. Acyclic programs. New Generation Computing, 9, 335-363, 1991.
3. A. Bossi and N. Cocco. Basic transformation operations which preserve computed answer substitutions of logic programs. Journal of Logic Programming, 16, 47-87, 1993.
4. A. Bossi, N. Cocco and S. Etalle. On safe folding. In Programming Language Implementation and Logic Programming - Proceedings PLILP'92, M. Bruynooghe and M. Wirsing, eds, Volume 631 of Lecture Notes in Computer Science, pp. 172-186. Springer-Verlag, Berlin, 1992.
5. A. Bossi, N. Cocco and S. Etalle. Transforming normal programs by replacement. In Meta Programming in Logic - Proceedings META '92, A. Pettorossi, ed., Volume 649 of Lecture Notes in Computer Science, pp. 265-279. Springer-Verlag, Berlin, 1992.
6. A. Bossi, N. Cocco and S. Etalle. Simultaneous replacement in normal programs. Technical Report CS-R9357, CWI, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, August 1993. Available via anonymous ftp at ftp.cwi.nl, or via xmosaic at http://www.cwi.nl/cwi/publications/index.html.
7. A. Bossi and S. Etalle. More on unfold/fold transformations of normal programs: preservation of Fitting's semantics. In Proc. Fourth International Workshop on Meta Programming in Logic, F. Turini, ed., Springer-Verlag, Berlin, 1994.
8. K. L. Clark. Negation as failure rule. In Logic and Data Bases, H. Gallaire and G. Minker, eds, pp. 293-322. Plenum Press, New York, 1978.
9. S. Etalle. Transformazione dei programmi logici con negazione, tesi di laurea, Dip. Matematica Pura e Applicata, Università di Padova, Padova, Italy, July 1991.
10. M. Falaschi, G. Levi, M. Martelli and C. Palamidessi. Declarative modelling of the operational behavior of logic languages. Theoretical Computer Science, 69, 289-318, 1989.
11. M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2, 295-312, 1985.
12. P. A. Gardner and J. C. Shepherdson. Unfold/fold transformations of logic programs. In Computational Logic: Essays in Honor of Alan Robinson, J.-L. Lassez and G. Plotkin, eds. MIT Press, Boston, MA, 1991.
13. S. C. Kleene. Introduction to Metamathematics. D. van Nostrand, Princeton, NJ, 1952.
14. K. Kunen. Negation in logic programming. Journal of Logic Programming, 4, 289-308, 1987.
15. J. W. Lloyd. Foundations of Logic Programming, second edition, Springer-Verlag, Berlin, 1987.
16. M. J. Maher. Correctness of a logic program transformation system. IBM Research Report RC13496, T. J. Watson Research Center, 1987.
17. M. J. Maher. A transformation system for deductive databases with perfect model semantics. Theoretical Computer Science, 110, 377-403, 1993.
18. T. Sato. Equivalence-preserving first-order unfold/fold transformation system. Theoretical Computer Science, 105, 57-84, 1992.
19. J. C. Shepherdson. Language and equality theory in logic programming. Technical Report PM-88-08, University Walk, Bristol, England, 1988.
20. H. Tamaki and T. Sato. Unfold/fold transformations of logic programs. In Proc. Second Int'l Conf. on Logic Programming, Sten-Åke Tärnlund, ed., pp. 127-139, 1984.