Toward A Foundation of Disjunctive Logic Programming.

Jack Minker

The complete paper is available in

Abstract

I provide a personal memoir on work that I have done and describe research that influenced my work that led to results in the foundation of disjunctive logic programming. I discuss my beginning experiences preceding Kowalski's development of logic programming; my early experiences in logic programming ; theoretical developments that culminated in a theory of disjunctive logic programming; and note some researchers whose work especially influenced
me.

Bibliography

[ABW88] K.R. Apt, H.A. Blair, and A. Walker. Towards a Theory of Declarative Knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89-148. Mor- gan Kaufmann Pub., Washington, D.C., 1988.
[AvE82] K.R. Apt and M.H. van Emden. Contributions to the Theory of Logic Programming. J.ACM, 29(3):841-862, 1982.
[CH85] A. Chandra and D. Harel. Horn clause queries and generalizations . Journal of Logic Programming, 2(1):1-15, April 1985.
[CKPR73] A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un sys- teme de communication homme-machine en francais. Technical report, Groupe de Intelligence Artificielle Universitae de Aix- Marseille II, Marseille, 1973.
[Cla78] K. L. Clark. Negation as Failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
[Dar68] J.L. Darlington. Automatic Theorem Proving With Equality Substitutions and Mathematical Induction. In D. Michie, editor, Machine Intelligence 3, page 405. American Elsevier Publishing Company, New York, 1968.
[Dar70] J. Darlington. Theorem Proving and Information Retrieval. In B. Meltzer and D. Michie, editors, Machine Intelligence 5, pages 173-182. American Elsevier Publishing Company, New York, 1970.
[Elc71] E.W. Elcock. Problem Solving Compilers. In N.V. Findler and B. Meltzer, editors, Artificial Intelligence and Heuristic Programming , page 327. American Elsevier Publishing Company, Inc., 1971.
[Elc90] E.W. Elcock. Absys: The first logic programming language - a retrospective and a commentary. Journal of Logic Programming, 9(1):1-17, July 1990.
[FM75] D.H. Fishman and J. Minker. Pi-representation: A clause representation for parallel search. Artificial Intelligence, 6(2):103-127, 1975.
[GL88] M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R.A. Kowalski and K.A. Bowen, editors, Proc. 5th International Conference and Symposium on Logic Programming , pages 1070-1080, Seattle, Washington, August 15-19 1988.
[GM78] H. Gallaire and J. Minker, editors. Logic and Databases. Plenum Press, New York, April 1978.
[GPP89] M. Gelfond, H. Przymusinska, and T.C. Przymusinski. On the relationship between circumscription and negation as failure. Jour- nal of Artificial Intelligence, 38:75-94, 1989.
[GR68] C.C. Green and B. Raphael. Research in intelligent question answering systems. Proc. ACM 23rd National Conference, pages 169-181, 1968.
[Gre69a] C.C. Green. Application of theorem proving to problem solving. In D.E. Walker L.M. Norton, editor, Proc. International Conference on Artificial Intelligence, pages 219-240, Washington D.C., 1969.
[Gre69b] C.C. Green. Theorem proving by resolution as a basis for question - answering systems. In B. Meltzer D. Michie, editor, Ma- chine Intelligence 4, pages 183-205. Edinburgh University Press, New York, 1969.
[Gre69c] C.C. Green. The Application of Theorem Proving to Question- Answering Systems. PhD thesis, Computer Science Department Stanford University, June 1969.
[Hew69] Carl Hewitt. PLANNER: A Language for Proving Theorems in Robots. In First International Joint Conference in Artificial Intelligence, pages 295-301, 1969.
[Hil74] R. Hill. Lush resolution and its completeness. Technical Report DCL Memo 78, Department of Artificial Intelligence, University of Edinburgh, August 1974.
[HNR68] P.E. Hart, N.J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. and Cybernetics, SSC-4 (2):100-107, 1968.
[HP88] L.J. Henschen and H. Park. Compiling the GCWA in Indefinite Databases. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 395-438. Morgan Kauf- mann Pub., Washington, D.C., 1988.
[JLL83] J. Jaffar, J.-L. Lassez, and J.W. Lloyd. Completeness of the Negation as Failure Rule. In Proceedings Eighth International Joint Conference on Artificial Intelligence, pages 500-506, Karl- sruhe, West Germany, 8-12 August 1983.
[KH68] R.A. Kowalski and P.J. Hayes. Semantic trees in automatic theorem-proving. In B. Meltzer D. Michie, editor, Machine Intelligence 4, pages 87-101. Edinburgh University Press, 1968.
[KH70] R.A Kowalski and P.J Hayes. Semantic Trees in Automatic Theorem-Proving. In B. Meltzer and D. Michie, editors, Machine Intelligence 5, pages 87-101. American Elsevier Publishing Company, 1970.
[KK71] R.A. Kowalski and D. Kuehner. Linear Resolution with Selection Function. Artificial Intelligence, 2:227-260, 1971.
[Kow70] R.A. Kowalski. Studies in the Completeness and Efficiency of Theorem-Proving by Resolution. PhD thesis, University of Edinburgh , 1970.
[Kow74] R.A. Kowalski. Predicate Logic as a Programming Language. Proc. IFIP 4, pages 569-574, 1974.
[Lif88] V. Lifschitz. On the declarative semantics of logic programs with negation. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, 1988.
[Llo87] J.W. Lloyd. Foundations of Logic Programming. Springer- Verlag, second edition, 1987.
[LM84] J.-L. Lassez and M.J. Maher. Closure and Fairness in the Semantics of Programming Logic. Theoretical Computer Science, 29:167-184, 1984.
[Lov69] D.W. Loveland. Theorem-provers combining model elimination and resolution. In B. Meltzer and De Michie, editors, Machine Intelligence 4, pages 73-86. University Press, Edinburgh, 1969.