A logical semantics for depth-first Prolog with ground negation

Theoretical Computer Science

Volumn 184, Issue 1-2, 1997, Pages 105-143

  Andrews, James ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; ERROR ANALYSIS; FUNCTIONS; LOGIC PROGRAMMING; PROLOG (PROGRAMMING LANGUAGE); THEOREM PROVING;

DEPTH FIRST LOGIC PROGRAMMING; DISJUNCTIVE UNFOLDING; GROUND NEGATION;

COMPUTATIONAL LINGUISTICS;

EID: 0031220140     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00138-7     Document Type: Article

References (47)

1. J.H. Andrews, The logical structure of sequential Prolog, in: Proc. 1990 North American Conf. on Logic Programming, Austin, Texas (MIT Press, Cambridge, MA, 1990) 585-602.
2. J.H. Andrews, Logic Programming: Operational Semantics and Proof Theory, Distinguished Dissertation Series (Cambridge Univ. Press, Cambridge, 1991).
3. J.H. Andrews, Kernel/congruence semantics: a homogeneous treatment of some asymmetry problems in the model theory of logic programming, Tech. Report 92-12, Centre for Systems Science, Simon Fraser University, Burnaby, BC, Canada, 1992.
4. J.H. Andrews, A logical semantics for depth-first Prolog with ground negation, Tech. Report 93-10, Centre for Systems Science, Simon Fraser University, Burnaby, BC, Canada, 1993.
5. J.H. Andrews, A logical semantics for depth-first Prolog with ground negation, in: Proc. Internat. Logic Programming Symp., Vancouver (MIT Press, Cambridge, MA, 1993).
6. J.H. Andrews, A paralogical semantics for the prolog cut, in: Proc. Internat. Logic Programming Symp., Portland (MIT Press, Cambridge, MA, 1995).
7. K.R. Apt, R.N. Bol and J.W. Klop, On the safe termination of Prolog programs, in: Proc. Sixth Internat. Conf. on Logic Programming, Lisbon (1989) 353-368.
8. K.R. Apt and E. Marchiori, Reasoning about prolog programs: from modes through types to assertions, Formal Aspects Comput. 6A (1995) 743-764.
9. K. Apt and D. Pedreschi, Proving termination of general Prolog programs, Inform. Comput. 106 (1993) 109-157.
10. K.R. Apt and M.H. van Emden, Contributions to the theory of logic programming, J. Assoc. Comput. Machinery 29 (1982) 841-862.
11. B. Arbab and D.M. Berry, Operational and denotational semantics of Prolog, J. Logic Programming 4 (1987) 309-329.
12. E. Babb, An incremental pure logic language with constraints and classical negation, in: T. Dodd, R. Owens and S. Torrance, eds., Logic Programming: Expanding the Horizons (Oxford, 1991) 14-62.
13. R. Barbuti, M. Codish, R. Giacobazzi and G. Levi, Modelling Prolog control, J. Logic Comput. 3 (1993) 579-603.
14. M. Baudinet, Proving termination properties of Prolog programs: a semantic approach, J. Logic Programming 14 (1992).
15. N.D. Belnap, Jr., A useful four-valued logic, in: J.M. Dunn and G. Epstein, eds., Modern Uses of Multiple-Valued Logic (Reidel, Dordrecht, 1975).
16. M. Bezem, Strong termination of logic programs, J. Logic Programming 15 (1993) 79-97.
17. M. Billaud, Simple operational and denotational semantics for Prolog with cut, Theoret. Comput. Sci. 71 (1990) 193-208.
18. E. Börger, A logical operational semantics of full Prolog, Technical Report IWBS Report 111, IBM Wissenschaftliches Zentrum, Institut für Wissensbasierte Systeme, Heidelberg, Germany, 1990.
19. F. Bronsard, T.K. Lakshman and U. Reddy, A framework of directionality for proving termination of logic programs, in: Proc. Joint Internat. Conf. Symp on Logic Programming, Washington, D.C. (MIT Press, Cambridge, MA, 1992) 321-335.
20. R.M. Burstall and J. Darlington, A transformation system for developing recursive programs, J. ACM 24 (1977) 44-67.
21. K.L. Clark, Negation as failure, in: Logic and Data Bases (Plenum Press, New York, 1978) 293-322.
22. V. Dahl, Two solutions for the negation problem, in: Workshop on Logic Programming, Debrecen, Hungary, 1980.
23. S. Debray and P. Mishra, Denotational and operational semantics of Prolog, J. Logic Programming 5 (1988) 61-91.
24. A. de Bruin and E.P. de Vink, Continuation semantics for Prolog with cut, in: Theory and Practice of Software Engineering, Lecture Notes in Computer Science, Vol. 351 (Springer, Berlin, 1989) 178-192.
25. P. Deransart and G. Ferrand, An operational formal definition of Prolog, Tech. Report RR763, INRIA, 1987.
26. M. Fitting, A Kripke-Kleene semantics for logic programs, J. Logic Programming 4 (1985) 295-312.
27. N. Francez, O. Grumberg, S. Katz and A. Pnueli, Proving termination of Prolog programs, in: R. Parikh, ed., Logics of Programs, Lecture Notes in Computer Science, Vol. 193 (Springer, Berlin, 1985) 89-105.
28. M. Gabbrieli and G. Levi, Unfolding and fixpoint semantics of concurrent constraint logic programs, Theoret. Comput. Sci. 105 (1992) 85-128.
29. S. Haridi, A logic programming language based on the Andorra model, New Generation Comput. 7 (1990) 109-125.
30. J. Harland, Towards a static proof system for negation as failure, Technical Report 92/10, University of Melbourne, School of Information Technology and Electrical Engineering, 1992.
31. N.D. Jones and A. Mycroft, Stepwise development of operational and denotational semantics for Prolog, in: Proc. 1984 Internat. Symp. on Logic Programming (1984).
32. S. Kripke, Outline of a theory of truth, J. Philos. 72 (1975) 690-716.
33. K. Kunen, Negation in logic programming, J. Logic Programming 4 (1987) 298-308.
34. G. Levi, Models, unfolding rules and fixpoint semantics, in: Proc. 1988 Internat. Conf. and Symp. on Logic Programming, Seattle, Washington (1988) 1649-1665.
35. J.W. Lloyd, Foundations of Logic Programming (Springer, Berlin, 1984).
36. P. McBrien, Implementing logic languages by graph rewriting, in: T. Dodd, R. Owens and S. Torrance, eds., Logic Programming: Expanding the Horizons (Intellect, Oxford, 1991), 164-188.
37. D. Miller, G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logic programming, Ann. Pure Appl. Logic 51 (1991) 125-157.
38. L. Naish, MU-Prolog 3.1 db Reference Manual, University of Melbourne, 1984.
39. L. Naish, Negation and Control in Prolog, Lecture Notes in Computer Science, Vol. 238 (Springer, Berlin, 1986).
40. T. Nicholson and N. Foo, A denotational semantics for Prolog, ACM Trans. on Programming Languages and Systems 11 (1989) 650-665.
41. G. Plotkin, A structural approach to operational semantics, Tech. Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, 1981.
42. L. Plümer, Termination Proofs for Logic Programs, Lecture Notes in Artificial Intelligence, Vol. 446 (Springer, Verlag, Berlin, 1990).
43. L. Plümer, Termination proofs for logic programs based on predicate inequalities, in: Proc. 1990 Internat. Conf. on Logic Programming, Jerusalem (1990) 634-648.
44. R. Stärk, The declarative semantics of the Prolog selection rule, in: Proc. 9th Ann. IEEE Symp. on Logic in Computer Science, Paris (MIT Press, Cambridge, MA, 1994).
45. H. Tamaki and T. Sato, Unfold/fold transformations of logic programs, in: Proc. 2nd Internat. Logic Programming Conf. Uppsala, Sweden (1984) 127-138.
46. P.J. Voda, A view of programming languages as symbiosis of meaning and computations, New Generation Comput. 3 (1985) 71-100.
47. M. Wallace, Tight, consistent, and computable completions for unrestricted logic programs, J. Logic Programming 15 (1993) 243-273.