Contributions to the Theory of Logic Programming

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Howard Arden Blair, The recursion-theoretic complexity of the fixed-point semantics of definite sentences, 1980
	2	Andrzej Blikle, Proving Programs by Sets of Computations, Proceedings of the 3rd Symposium on Mathematical Foundations of Computer Science, p.333-358, June 17-22, 1974
	3	Chin-Liang Chang , Richard C. Lee , Richard Char-Tung Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, Inc., Orlando, FL, 1997
	4	CLark, K.L. Negauon as failure. In Logw and Data Bases, H. Gallatre and J. Mmker, Eds, Plenum Press, New York, 1978, pp. 293-324.
	5	CLARK, K.L.Predicate logic as a computational formahsm Res. Rep., Dep. of Computing, Imperial College, London, 1979.
	6	Alain Colmerauer, Metamorphosis Grammars, Natural Language Communication with Computers, p.133-189, January 1978
	7	Edsger Wybe Dijkstra, A Discipline of Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1997
	8	HAREL, O On the total correctness of nondeterministtc programs. Theor. Comput Set !3 (1981), 175-192
	9	HILL, R.LUSH-resolution and its completeness Memo 78, Dep of Computauonal Logic, Univ. of Edinburgh, Edinburgh, Scotland, 1974.
	10	HITCltCOCK, P., AND PARK, D.lnducnon rules and termmauon proofs. In Automata, Languages, and Programming, M Nivat, Ed, North-Holland, Amsterdam, 1973.
	11	KOWALSKI, R A.Predicate logic as a programming language. In Informatton Processing 74, J Rosenfeld, Ed., North-Holland, Amsterdam, 1974, pp. 556-574.
	12	Robert Kowalski, Logic for problem-solving, North-Holland Publishing Co., Amsterdam, The Netherlands, 1986
	13	LOVF.LAND, D.W Automated Theorem Proving North-Holland, Amsterdam, 1978.
	14	REITER, R.On dosed-world data bases. In Logtc and Data Bases, H. Gallalre and J Minker, Eds, Plenum Press, New York, 1978, pp. 55--76
	15	J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965 [doi>10.1145/321250.321253]
	16	ROBINSOh', J.A. Logtc. Function and Form. Edinburgh Umversity Press, Edinburgh, Scotland, 1979.
	17	VAN EMDEN, M.H Verificatmn condmons as programs In Automata, Languages, and Program. ruing, S Mtchaelson and R MiMer, Eds., Edinburgh Universtty Press, Edinburgh, Scotland, 1976, pp 99-119
	18	VAN EMDEN, M.H Computatmn and deductive lnformauon retrieval In Formal Descr~twn of Programming Concepts, E Neuhold, Ed, North-Holland, Amsterdam, 1978, pp. 421-440
	19	M. H. Van Emden , R. A. Kowalski, The Semantics of Predicate Logic as a Programming Language, Journal of the ACM (JACM), v.23 n.4, p.733-742, Oct. 1976 [doi>10.1145/321978.321991]