Knowledge Representation with logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1471 LNAI, Issue , 1998, Pages 1-51

  Brewka, Gerhard ^a   Dix, Jürgen ^b  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b Institut für Informatik ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; KNOWLEDGE REPRESENTATION; PROLOG (PROGRAMMING LANGUAGE); QUERY PROCESSING; SEMANTICS;

BOTTOM-UP EVALUATIONS; FINITE FAILURE; FUNCTION SYMBOLS; GENERALIZED LOGIC PROGRAM; LOGIC PROGRAMS; QUERY ANSWERING; RECURSIONS; TOP DOWN APPROACHES;

LOGIC PROGRAMMING;

EID: 84867807930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054788     Document Type: Conference Paper

References (122)

1. J. J. Alferes, Carlos Viegas Damasio, and L. M. Pereira. A logic programming system for non-monotonic reasoning. Journal of Automated Reasoning, 14(1):93-147, 1995.
2. Jose Julio Alferes and Luiz Moniz Pereira. An argumentation theoretic semantics based on non-refutable falsity. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 3-22. Springer, Berlin, 1995.
3. Jose Julio Alferes and Luiz Moniz Pereira, editors. Reasoning with Logic Programming, LNAI 1111, Berlin, 1996. Springer.
4. Jose Julio Alferes, Luiz Moniz Pereira, and Teodor Przymusinski. Strong and Explicit Negation in Non-Monotonic Reasoning and Logic Programming. In J.J Alferes, L.M. Pereira, and E. Orlowska, editors, Logics in Artificial Intelligence (JELIA '96), LNCS 1126, pages 143-163. Springer, 1996.
5. Krzysztof R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, chapter 10, pages 493-574. Elsevier Science Publishers, 1990.
6. Krzysztof R. Apt and Roland N. Bol. Logic Programming and Negation: A Survey. Journal of Logic Programming, 19-20:9-71, 1994.
7. Chandrabose Aravindan. An abductive framework for negation in disjunctive logic programming. In J. J. Alferes, L. M. Pereira, and E. Orlowska, editors, Proceedings of Joint European workshop on Logics in AI, number 1126 in Lecture Notes in Artificial Intelligence, pages 252-267. Springer-Verlag, 1996. A related report is available on the web from .
8. Chandrabose Aravindan, Jürgen Dix, and Ilkka Niemelä. Dislop: A research project on disjunctive logic programming. AI Communications, 10(3/4):151-165, 1997.
9. Chandrabose Aravindan, Jürgen Dix, and Ilkka Niemelä. DisLoP: Towards a Disjunctive Logic Programming System. In J. Dix, U. Furbach, and A. Nerode, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Fourth International Conference, LNAI 1265, pages 342-353, Berlin, June 1997. Springer.
10. Chitta Baral and Michael Gelfond. Logic Programming and Knowlege Representation. Journal of Logic Programming, 19-20:73-148, 1994.
11. Chitta Baral and V.S. Subrahmanian. Dualities between Alternative Semantics for Logic Programming and Non-monotonic Reasoning. In Anil Nerode, Wiktor Marek, and V. S. Subrahmanian, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the first International Workshop, pages 69-86, Cambridge, Mass., July 1991. Washington D.C, MIT Press.
12. Chitta Baral and V.S. Subrahmanian. Stable and Extension Class Theory for Logic Programs and Default Logics. Journal of Automated Reasoning, 8, No. 3:345-366, 1992.
13. P. Baumgartner and U. Furbach. Model Elimination without Contrapositives and its Application to PTTP. Journal of Automated Reasoning, 13:339-359, 1994.
14. Short version in: Proceedings of CADE-12, Springer LNAI 814, 1994, pp 87-101.
15. P. Baumgartner, U. Furbach, and I. Niemela. Hyper Tableaux. In Proc. JELIA 96, number 1126 in LNAI. European Workshop on Logic in AI, Springer, 1996. (Long version in: Fachberichte Informatik, 8-96, Universität Koblenz-Landau).
16. P. Baumgartner, U. Furbach, and F. Stolzenburg. Model Elimination, Logic Programming and Computing Answers. In Proceedings of IJCAI '95, 1995. (to appear, Long version in: Research Report 1/95, University of Koblenz, Germany).
17. Catril Beeri and Raghu Ramakrishnan. On the power of magic. The Journal of Logic Programming, 10:255-299, 1991.
18. Colin Bell, Anil Nerode, Raymond T. Ng, and V. S. Subrahmanian. Implementing Stable Semantics by Linear Programming. In Luis Moniz Pereira and Anil Nerode, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Second International Workshop, pages 23-42, Cambridge, Mass., July 1993. Lisbon, MIT Press.
19. Colin Bell, Anil Nerode, Raymond T. Ng, and V. S. Subrahmanian. Mixed Integer Programming Methods for Computing Non-Monotonic Deductive Databases. Journal of the ACM, 41(6):1178-1215, November 1994.
20. Nicole Bidoit and Christine Froidevaux. General logical Databases and Programs: Default Logic Semantics and Stratification. Information and Computation, 91:15-54, 1991.
21. Nicole Bidoit and Christine Froidevaux. Negation by Default and unstratifiable logic Programs. Theoretical Computer Science, 78:85-112, 1991.
22. Roland N. Bol and L. Degerstedt. Tabulated resolution for well-founded semantics. In Proc. Int. Logic Programming Symposium'93, Cambridge, Mass., 1993. MIT Press.
23. Stefan Brass and Jürgen Dix. A disjunctive semantics based on unfolding and bottom-up evaluation. In Bernd Wolfinger, editor, Innovationen bei Recben - und Kommunikationssystemen, (IFIP '94-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases), pages 83-91, Berlin, 1994. Springer.
24. Stefan Brass and Jürgen Dix. A General Approach to Bottom-Up Computation of Disjunctive Semantics. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 127-155. Springer, Berlin, 1995.
25. Stefan Brass and Jürgen Dix. Characterizations of the Stable Semantics by Partial Evaluation. In A. Nerode, W. Marek, and M. Truszczyński, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Third International Conference, LNCS 928, pages 85-98, Berlin, June 1995. Springer.
26. Stefan Brass and Jürgen Dix. D-WFS: A Confluent calculus and an Equivalent Characterization. Technical Report TR12/95, University of Koblenz, Department of Computer Science, Rheinau 1, September 1995.
27. Stefan Brass and Jürgen Dix. Disjunctive Semantics based upon Partial and Bottom-Up Evaluation. In Leon Sterling, editor, Proceedings of the 12th Int. Conf. on Logic Programming, Tokyo, pages 199-213. MIT Press, June 1995.
28. Stefan Brass and Jürgen Dix. Characterizing D-WFS: Confluence and Iterated GCWA. In L.M. Pereira J.J. Alferes and E. Orlowska, editors, Logics in Artificial Intelligence (JELIA '96), LNCS 1126, pages 268-283. Springer, 1996. (Extended version will appear in the Journal of Automated Reasoning in 1998.).
29. Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. Journal of Logic Programming, 32(3):207-228, 1997.
30. (Extended abstract appeared in: Characterizations of the Stable Semantics by Partial Evaluation LPNMR, Proceedings of the Third International Conference, Kentucky, pages 85-98, 1995. LNCS 928, Springer.).
31. Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated GCWA. Journal of Automated Reasoning, 20(1):143-165, 1998.
32. (Extended abstract appeared in: Characterizing D-WFS: Confluence and Iterated GCWA. Logics in Artificial Intelligence, JELIA '96, pages 268-283, 1996. Springer, LNCS 1126.).
33. Stefan Brass and Jürgen Dix. Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming, accepted for publication, 1998.
34. (Extended abstract appeared in: Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation, Proceedings of the 12-th International Logic Programming Conference, Tokyo, pages 199-213, 1995. MIT Press.).
35. Stefan Brass, Jürgen Dix, Burkhard Freitag, and Zukowski. Transformation-based bottom-up computation of the well-founded model. Journal of Logic Programming, to appear, 1999.
36. Stefan Brass, Jürgen Dix, Ilkka Niemelä, and Teodor. C. Przymusinski. A Comparison of the Static and the Disjunctive Well-founded Semantics and its Implementation. In A. G. Cohn, L. K. Schubert, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), pages 74-85. San Francisco, CA, Morgan Kaufmann, May 1998. appeared also as TR 17/97, University of Koblenz.
37. Stefan Brass, Jürgen Dix, and Teodor. C. Przymusinski. Super Logic Programs. In L. C. Aiello, J. Doyle, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR '96), pages 529-541. San Francisco, CA, Morgan Kaufmann, 1996.
38. Stefan Brass, Ulrich Zukowski, and Burkhardt Freitag. Transformation Based Bottom-Up Computation of the Well-Founded Model. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 1216, pages 171-201. Springer, Berlin, 1997.
39. G. Brewka. Adding priorities and specificity to default logic. In Logics in Artificial Intelligence, Proc. JELIA-94, York. Springer, 1994.
40. Gerd Brewka, Jürgen Dix, and Kurt Konolige. Nonmonotonic Reasoning: An Overview. CSLI Lecture Notes 73. CSLI Publications, Stanford, CA, 1997.
41. Gerhard Brewka. Well-founded semantics for extended logic programs with dynamic preferences. Journal of Artificial Intelligence Research, 4:19-36, 1996.
42. Gerhard Brewka and Thomas Eiter. Preferred answer sets. In Anthony Cohn, Lenhart Schubert, and Stuart Shapiro, editors, Proceedings of the 6th Conference on Principles of Knowledge Representation and Reasoning, Trent, Italy, pages 86-97. Morgan Kaufmann, 1998.
43. François Bry. Query evaluation in recursive databases: bottom-up and top-down reconciled. Data & Knowledge Engineering, 5:289-312, 1990.
44. M. Cadoli, F. M. Donini, P. Liberatore, and M. Schaerf. The size of a revised knowledge base. In PODS '95, pages 151-162, 1995.
45. Marco Cadoli, Francesco M. Donini, and Marco Schaerf. Is intractability of nonmonotonic reasoning a real drawback? Artificial Intelligence Journal, 88:215-251, 1996.
46. Marco Cadoli, Francesco M. Donini, Marco Schaerf, and Riccardo Silvestri. On compact representations of propositional circumscription. Theoretical Computer Science, 182:183-202, 1997.
47. (Extended abstract appeared in: On Compact Representations of Propositional Circumscription. STACS '95, pages 205-216, 1995.).
48. L. Cavedon and J.W. Lloyd. A Completeness Theorem for SLDNF-Resolution. Journal of Logic Programming, 7:177-191, 1989.
49. David Chan. Constructive negation based on the completed database. In Proc. 1988 Conf. and Symp. on Logic Programming, pages 111-125, September 1988.
50. David Chan and Mark Wallace. An Experiment with programming using pure Negation. Technical Report TR, ECRC, July 1989.
51. Weidong Chen, Terranće Swift, and David S. Warren. Efficient Top-Down Computation of Queries under the Weil-Founded Semantics. Journal of Logic Programming, 24(3):219-245, 1995.
52. Weidong Chen and David S. Warren. A Goal Oriented Approach to Computing The Well-founded Semantics. Journal of Logic Programming, 17:279-300, 1993.
53. Weidong Chen and David S. Warren. Computing of Stable Models and its Integration with Logical Query Processing. IEEE Transactions on Knowledge and Data Engineering, 17:279-300, 1995.
54. Weidong Chen and David S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20-74, January 1996.
55. Keith L. Clark. Negation as Failure. In H. Gallaire and J. Minker, editors, Logic and Data-Bases, pages 293-322. Plenum, New York, 1978.
56. A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un système de communication homme-machine en français. Technical report, Groupe de Intelligence Artificielle Universite de Aix-Marseille II, 1973.
57. Stefania Costantini and Gaetano A. Lanzarone. Static Semantics as Program Transformation and Well-founded Computation. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 156-180. Springer, Berlin, 1995.
58. Lars Degerstedt and Ulf Nilsson. Magic Computation of Well-founded Semantics. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 181-204. Springer, Berlin, 1995.
59. J. Dix and U. Furbach. The DFG-Project DisLoP on Disjunctive Logic Programming. Computational Logic, 2(2):89-90, 1996.
60. J. Dix, U. Furbach, and A. Nerode, editors. Logic Programming and Nonmonotonic Reasoning, LNAI 1265, Berlin, 1997. Springer.
61. Jürgen Dix. Classifying Semantics of Logic Programs. In Anil Nerode, Wiktor Marek, and V. S. Subrahmanian, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the first International Workshop, pages 166-180, Cambridge, Mass., July 1991. Washington D.C, MIT Press.
62. Jürgen Dix. A Framework for Representing and Characterizing Semantics of Logic Programs. In B. Nebel, C. Rich, and W. Swartout, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR '92), pages 591-602. San Mateo, CA, Morgan Kaufmann, 1992.
63. Jürgen Dix. Classifying Semantics of Disjunctive Logic Programs. In K. R. Apt, editor, LOGIC PROGRAMMING: Proceedings of the 1992 Joint International Conference and Symposium, pages 798-812, Cambridge, Mass., November 1992. MIT Press.
64. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Properties. Fundamenta Informaticae, XXII(3):227-255, 1995.
65. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, XXII(3):257-288, 1995.
66. Jürgen Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview. In Andre Fuhrmann and Hans Rott, editors, Logic, Action and Information - Essays on Logic in Philosophy and Artificial Intelligence, pages 241-327. DeGruyter, 1995.
67. Jürgen Dix, Donald Loveland, Jack Minker, and David. S. Warren. Disjunctive Logic Programming and databases: Nonmonotonic Aspects. Technical Report Dagstuhl Seminar Report 150, IBFI GmbH, Schloß Dagstuhl, 1996.
68. Jürgen Dix and Martin Müller. abstracrt Properties and Computational Complexity of Semantics for Disjunctive Logic Programs. In Proc. of the Workshop Wl, Structural Complexity and Recursion-theoretic Methods in Logic Programming, following the JICSLP '92, pages 15-28. H. Blair and W. Marek and A. Nerode and J. Remmel, November 1992. also available as Technical Report 13/93, University of Koblenz, Department of Computer Science.
69. Jürgen Dix and Martin Miiller. Implementing Semantics for Disjunctive Logic Programs Using Fringes and abstract Properties. In Luis Moniz Pereira and Anil Nerode, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Second International Workshop, pages 43-59, Cambridge, Mass., July 1993. Lisbon, MIT Press.
70. Jürgen Dix and Frieder Stolzenburg. Computation of Non-Ground Disjunctive Well-Founded Semantics with Constraint Logic Programming (preliminary report). In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 1216, pages 202-226. Springer, Berlin, 1997.
71. Jürgen Dix and Frieder Stolzenburg. A Framework to incorporate Nonmonotonic Reasoning into Constraint Logic Programming. Journal of Logic Programming, 35(1, 2, 3):5-37, 1998. Special Issue on Constraint Logic Programming, Guest Editors: Kim Marriott and Peter Stuckey.
72. Wlodzimierz Drabent. What is failure? A constructive approach to negation. Acta Informatica, 32(1):27-29, 1994.
73. P. M. Dung. On the relations between stable and wellfounded semantics of logic programs. Theoretical Computer Science, 105:7-25, 1992.
74. T. Eiter, J. Lu, and V. S. Subrahmanian. Computing Non-Ground Representations of Stable Models. In J. Dix, U. Furbach, and A. Nerode, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Fourth International Conference, LNAI 1265, pages 198-217, Berlin, July 1997. Springer.
75. F. Fages. Consistency of Clark's completion and existence of stable models. Methods of Logic in Computer Science, 2, 1993.
76. J. A. Fernández, J. Lobo, J. Minker, and V.S. Subrahmanian. Disjunctive LP + Integrity Constraints = Stable Model Semantics. Annals of Mathematics and Artificial Intelligence, 8(3-4), 1993.
77. J. A. Fernández and J. Minker. Bottom-Up Computation of Perfect Models for Disjunctive Theories. Journal of Logic Programming, 25(1):33-51, 1995.
78. Michael Gelfond and Vladimir Lifschitz. The Stable Model Semantics for Logic Programming. In R. Kowalski and K. Bowen, editors, 5th Conference on Logic Programming, pages 1070-1080. MIT Press, 1988.
79. Goran Gogic, Christos Papadimitriou, Bart Selman, and Henry Kautz. The Comparative Linguistics of Knowledge Representation. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 862-869, Montreal, Canada, August 1995. Morgan Kaufmann Publishers.
80. T. F. Gordon. The Pleadings Game: An Artificial Intelligence Model of Procedural Justice. PhD thesis, TU Darmstadt, 1993.
81. Jeff Horty, Richmond Thomason, and D. S. Touretzky. A skeptical Theory of Inheritance in Nonmonotonic Semantic Networks. Artificial Intelligence, 42:311-348, 1990.
82. Katsumi Inoue, M. Koshimura, and R. Hasegawa. Embedding negation-as-failure into a model generation theorem prover. In Deepak Kapur, editor, Automated Deduction - CADE-11, number 607 in LNAI, Berlin, 1992. Springer.
83. Vadim Kagan, Anil Nerode, and V. S. Subrahmanian. Computing Definite Logic Programs by Partial Instantiation. Annals of Pure and Applied Logic, 67:161-182, 1994.
84. Vadim Kagan, Anil Nerode, and V. S. Subrahmanian. Computing Minimal Models by Partial Instantiation. Theoretical Computer Science, 155:157-177, 1995.
85. David B. Kemp, Peter J. Stuckey, and Divesh Srivastava. Magic Sets and Bottom-Up Evaluation of Well-Founded Models. In Vijay Saraswat and Kazunori Ueda, editors, Proceedings of the 1991 Int. Symposium on Logic Programming, pages 337-351. MIT, June 1991.
86. Kurt Konolige. Partial Models and Non-Monotonic Reasoning. In J. Richards, editor, The Logic and Aquisition of Knowledge. Oxford Press, 1988.
87. R.A. Kowalski. Predicate logic as a programming language. In Proceeedings IFIP' 74, pages 569-574. North Holland Publishing Company, 1974.
88. V. Lifschitz. Foundations of declarative logic programming. In G. Brewka, editor, Principles of Knowledge Representation, chapter 3, pages 69-128. CSLI, 1996.
89. Vladimir Lifschitz. Computing Circumscription. In Proceedings of the International Joint Conference on Artificial Intelligence, Los Angeles, California, pages 121-127, 1985.
90. John W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1987. 2nd edition.
91. Bertram Ludäscher. CNF-Prolog: A Meta-Interpreter for Chan's Constructive Negation, Implementation. Technical report, Master Thesis, Karlsruhe University (in german), 1991.
92. Jack Minker. On indefinite databases and the closed world assumption. In Proceedings of the 6th Conference on Automated Deduction, New York, pages 292-308, Berlin, 1982. Springer.
93. Jack Minker. Foundations of Deductive Databases. Morgan Kaufmann, 95 First Street, Los Altos, CA 94022, 1st edition, 1988.
94. Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17(2/3/4):95-126, 1993.
95. Jack Minker and Carolina Ruiz. Computing stable and partial stable models of extended disjunctive logic programs. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 205-229. Springer, Berlin, 1995.
96. Martin Müller. Examples and Run-Time Data from KORF, 1992.
97. Martin Müller and Jürgen Dix. Implementing Semantics for Disjunctive Logic Programs Using Fringes and abstract Properties. In Luis Moniz Pereira and Anil Nerode, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Second International Workshop, pages 43-59, Cambridge, Mass., July 1993. Lisbon, MIT Press.
98. Anil Nerode, Raymond T. Ng, and V.S. Subrahmanian. Computing Circumscriptive Deductive Databases. CS-TR 91-66, Computer Science Dept., Univ. Maryland, University of Maryland, College Park, Maryland, 20742, USA, December 1991.
99. Ilkka Niemelä. Implementing circumscription using a tableau method. In W. Wahlster, editor, Proceedings of the European Conference on Artificial Intelligence, pages 80-84, Budapest, Hungary, August 1996. John Wiley.
100. Ilkka Niemela. A tableau calculus for minimal model reasoning. In P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors, Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 278-294, Terrasini, Italy, May 1996. LNAI 1071, Springer-Verlag.
101. Ilkka Niemela and Patrik Simons. Efficient Implementation of the Well-founded and Stable Model Semantics. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 289-303, Bonn, Germany, September 1996. The MIT Press.
102. L. M. Pereira, J. N. Aparicio, and J. J. Alferes. Non-Monotonic Reasoning with Logic Programming. Journal of Logic Programming, 17:227-264, 1993.
103. L.M. Pereira and J.J. Alferes. Well founded semantics for logic programs with explicit negation. In Bernd Neumann, editor, Proc. of 10th European Gonf. on Artificial Intelligence ECAI 92, pages 102-106. John Wiley & Sons, 1992.
104. D. Poole. On the comparison of theories: Preferring the most specific explanation. In Proc. IJCAI-85, Los Angeles, 1985.
105. H. Prakken. Logical Tools for Modelling Legal Argument. PhD thesis, VU Amsterdam, 1993.
106. Teodor Przymusinski. Stationary Semantics for Normal and Disjunctive Logic Programs. In C. Delobel, M. Kifer, and Y. Masunaga, editors, DOOD '91, Proceedings of the 2nd International Conference, Berlin, December 1991. Muenchen, Springer. LNCS 566.
107. Raymond Reiter. On closed world data bases. In Hervé Gallaire and Jack Minker, editors, Logic and Data Bases, pages 55-76, New York, 1978. Plenum.
108. Raymond Reiter. A Logic for Default-Reasoning. Artificial Intelligence, 13:81-132, 1980.
109. Stuart Russel and Peter Norvig. Artificial Intelligence - A Modern Approach. Prentice Hall, New Jersey 07458, 1995.
110. Ch. Sakama and K. Inoue. An Alternative Approach to the Semantics of Disjunctive Logic Programs and Deductive Databases. Journal of Automated Reasoning, 13:145-172, 1994.
111. Chiaki Sakama and Hirohisa Seki. Partial Deduction of Disjunctive Logic Programs: A Declarative Approach. In Logic Program Synthesis and Transformation - Meta Programming in Logic, LNCS 883, pages 170-182, Berlin, 1994. Springer.
112. Chiaki Sakama and Hirohisa Seki. Partial Deduction in Disjunctive Logic Programming. Journal of Logic Programming, 32(3):229-245, 1997.
113. H. Tamaki and T. Sato. OLD Resolution with Tabulation. In Proceedings of the Third International Conference on Logic Programming, London, LNAI, pages 84-98, Berlin, June 1986. Springer.
114. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309, 1955.
115. D. S. Touretzky. The Mathematics of Inheritance. Research Notes in Artificial Intelligence. Pitman, London, 1986.
116. D. S. Touretzky, R. H. Thomason, and J. F. Horty. A skeptic's menagerie: Conflictors, preemptors, reinstaters, and zombies in nonmonotonic inheritance. In Proc. 12th IJCAI, Sydney, 1991.
117. David S. Touretzky, Jeff Horty, and Richmond Thomason. A Clash of Intuitions: The current State of Nonmonotonic Multiple IHS. In Proceedings IJCAJ, 1988.
118. Jeffrey D. Ullman. Bottom-up Beats Top-down for Datalog. In Proc. of the Eight ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, Pennsylvania, pages 140-149. ACM Press, March 1989.
119. Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, Vol. 2. Computer Science Press, Rockville, 1989.
120. M.H. van Emden and R.A. Kowalski. The semantics of predicate logic as a programming language. J ACM, 23:733-742, 1976.
121. Allen Van Gelder, Kenneth A. Ross, and J. S. Schlipf. Unfounded Sets and well-founded Semantics for general logic Programs. In Proceedings 7th Symposion on Principles of Database Systems, pages 221-230, 1988.
122. Martin Vorbeck. CNF-Prolog: A Meta-Interpreter for Chan's Constructive Negation, Theory. Technical report, Master Thesis, Karlsruhe University (in german), 1991.