A closer look at declarative interpretations

Journal of Logic Programming

Volumn 28, Issue 2, 1996, Pages 147-180

  Apt, Krzysztof R ^a   Gabbrielli, Maurizio ^b   Pedreschi, Dino ^b  

^a CWI   (Netherlands)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; DIGITAL ARITHMETIC; MATHEMATICAL MODELS; PROLOG (PROGRAMMING LANGUAGE); TURING MACHINES;

DECLARATIVE INTERPRETATIONS; LEAST HERBRAND MODEL; SEMANTICS;

LOGIC PROGRAMMING;

EID: 0030217170     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(95)00150-6     Document Type: Article

References (22)

1. Apt, K. R., Program Verification and Prolog, in: E. Börger (ed.), Specification and Validation Methods for Programming Languages and Systems, Oxford University Press, 1995, pp. 55-95.
2. Apt, K. R. and Gabbrielli, M., Declarative Interpretations Reconsidered, in: P. van Hentenryck (ed.), Proceedings of Eleventh International Conference on Logic Programming, MIT Press, Cambridge, MA, 1994, pp. 74-89.
3. Apt, K. R. and Marchiori, E., Reasoning about Prolog Programs: From Modes through Types to Assertions, Formal Aspects of Computing 6(6A):743-765 (1994).
4. Apt, K. R. and Pedreschi, D., Reasoning about Termination of Pure Prolog Programs, Inform. and Comput. 106(1):109-157 (1993).
5. Apt, K. R. and van Emden, M. H., Contributions to the Theory of Logic Programming, J. ACM 29(3):841-862 (1982).
6. Bossi, A. and Cocco, N., Verifying Correctness of Logic Programs, in: Proceedings of TAPSOFT '89, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1989, pp. 96-110.
7. Bossi, A., Gabbrielli, M., Levi, G., and Martelli, M., The s-Semantics Approach: Theory and Applications, J. Logic Programming 19-20:149-197 (1994).
8. Clark, K. L., Predicate Logic as a Computational Formalism, Research Report DOC 79/59, Dept. of Computing, Imperial College, London, 1979.
9. Deransart, P., Proof Methods of Declarative Properties of Definite Programs, Theoret. Comput. Sci. 118:99-166 (1993).
10. Drabent, W. and Małuszynski, J., Inductive Assertion Method for Logic Programs, Theoret. Comput. Sci. 59(1):133-155 (1988).
11. Falaschi, M., Levi, G., Martelli, M., and Palamidessi, C., Declarative Modeling of the Operational Behavior of Logic Languages, Theoret. Comput. Sci. 69(3):289-318 (1989).
12. Falaschi, M., Levi, G., Martelli, M., and Palamidessi, C., A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs, Inform. and Comput. 102(1):86-113 (1993).
13. Kunen, K., Some remarks on the Completed Database, in: R. A. Kowaski and K. A. Bowen (eds.), Proceedings of the Fifth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 978-992.
14. Lloyd, J. W., Foundations of Logic Programming, 2nd ed., Springer-Verlag, Berlin, 1987.
15. Maher, M. J., Equivalences of Logic Programs, in: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 627-658.
16. Maher, M. J. and Ramakrishnan, R., Déjà Vu in Fixpoints of Logic Programs, in: E. Lusk and R. Overbeek (Eds.), Proceedings of the North American Conference on Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 963-980.
17. Ruggieri, S., Metodi Formali per lo Sviluppo di Programmi Logic, Tesi di Laurea, Technical Report, Dipartimento di Informatica, Università di Pisa, 1994 (in Italian).
18. Shepherdson, J. C., Unsolvable Problems for SLDNF Resolution, J. Logic Programming 1(19):19-22 (1991).
19. Stärk, R., A Direct Proof for the Completeness of SLD-Resolution, in: E. Börger, H. Kleine Büning, and M. M. Richter (eds.), Computation Theory and Logic 89, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1990, Vol. 440, pp. 382-383.
20. Sterling, L. and Shapiro, E. Y., The Art of Prolog, MIT Press, Cambridge, MA, 1986.
21. Ullman, J. D., Principles of Database and Knowledge-Base Systems, Computer Science Press, Rockville, MD, 1988, Vol. 1.
22. van Emden, M. H. and Kowalski, R. A., The Semantics of Predicate Logic as a Programming Language, J. ACM 23(4):733-742 (1976).