Explanatory nonmonotonic reasoning

Explanatory Nonmonotonic Reasoning

Volumn , Issue , 2005, Pages 1-408

  Bochman, Alexander ^a  

^a HOLON INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85115665245     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/5707     Document Type: Book

References (139)

1. C. Alchourrón, P. Gärdenfors, and D. Makinson. On the logic of theory change:Partial meet contraction and revision functions. Journal of Symbolic Logic, 50:510-530, 1985.
2. K. R. Apt and R. N. Bol. Logic programming and negation: A survey. Journal of Logic Programming, 19, 20:9-71, 1994.
3. K. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89-148. Morgan Kaufmann, San Mateo, CA, 1988.
4. O. Arieli and A. Avron. Reasoning with logical bilattices. Journal of Logic, Language, and Information, 5:25-63, 1996.
5. Y. Babovich, E. Erdem, and V. Lifschitz. Fages’ theorem and answer set programming. In Proceedings of the Nonmonotonic Reasoning Workshop, NMR-2000, 2000.
6. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19, 20:73-148, 1994.
7. C. Baral and V. S. Subrahmanian. Dualities between alternative semantics for logic programming and nonmonotonic reasoning (extended abstract). In Proc. 1st Int. Worksop on Logic Programming and Nonmonotonic Reasoning, pages 69-86, 1991.
8. C. Baral and V. S. Subrahmanian. Stable and extension class theory for logic programs and default logics. J. of Automated Reasoning, 8:345-366, 1992.
9. C. Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge UP, 2003.
10. N. D. Belnap, Jr. A useful four-valued logic. In M. Dunn and G. Epstein, editors, Modern Uses of Multiple-Valued Logic, pages 8-41. D. Reidel, 1977.
11. R. Ben-Eliyahu. Fen-Eliyahu. From program completion to default logic. In Proc. 10th Israeli Symp. On Artificial Intelligence, Computer Vision, and Neural Networks, Ramat Gan, 1993.
12. S. Blarney. Partial logic. In D. M. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, Vol. Ill, pages 1-70. D. Reidel, 1986.
13. A. Bochman. On bimodal nonmonotonic logics and their unimodal and non-modal equivalents. In Proc. IJCAI’95, pages 1518-1524 1995.
14. A. Bochman. A study of Przymusinski’s static semantics. In Proc. Int. Conf. On Logic Programming and Nonmonotonic Reasoning, LPNMR’97, LNAI 1265, pages 170-184. Springer, 1997.
15. A. Bochman. A logical foundation for logic programming, I and II. Journal of Logic Programming, 35:151-194, 1998.
16. A. Bochman. On the relation between default and modal nonmonotonic reasoning. Artificial Intelligence, 101:1-34, 1998.
17. A. Bochman. A Logical Theory of Nonomonotonic Inference and Belief Change. Springer, 2001.
18. A. Bochman. Collective argumentation and disjunctive logic programming. Journal of Logic and Computation, 9:55-56, 2003.
19. P. Bonatti. Shift-based semantics: General results and applications. Technical Report CD-TR-93-59, Technical University of Vienna, 1993.
20. A. Bondarenko, P. M. Dung, R. A. Kowalski, and F. Toni. An abstract, argumentation-theoretic framework for default reasoning. Artificial Intelligence, 93:63-101, 1997.
21. S. Brass and J. Dix. Disjunctive semantics based upon partial and bottom-up evaluation. In L. Sterling, editor, Proc. 12Th Int. Conf. On Logic Programming, pages 199-213. MIT Press, 1995.
22. S. Brass and J. 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, volume 927 of LNAI, pages 127-155. Springer, 1995.
23. S. Brass, J. Dix, I. Niemelä, and T. Przymusinski. Comparison and efficient computation of the static and the disjunctive WFS. In G. Brewka, E. Weydert, and C. Witteveen, editors, Proceedings of the third Dutch-German Workshop on Nonmonotonic Reasoning and its Applications, pages 37-42 1997.
24. R. A. Bull and K. Segerberg. Basic modal logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, pages 1-88. Dordrecht: D. Reidel, 1984.
25. K. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, 1978.
26. L. Console, D. Theseider Dupre, and P. Torasso. On the relationship between abduction and deduction. Journal of Logic and Computation, 1:661-690, 1991.
27. M. Denecker, V. W. Marek, and M. Truszczyriski. Uniform semantic treatment of default and autoepistemic logics. Artificial Intelligence, 143:79-122, 2003.
28. J. Dix and M. Miiller. Partial evaluation and relevance for approximations of the stable semantics. In Z. W. Raz and M. Zemankova, editors, Methodologies of Intelligent Systems, ISMIS’94, volume 869 of LNAI, pages 511-520. Springer, 1994.
29. J. Dix, G. Gottlob, and V. Marek. Causal models for disjunctive logic programs. In P.Van Hentenryck, editor, Proc. 11th Int. Conf. On Logic Programming, S. Margherita Ligure, pages 290-302. MIT Press, 1994.
30. J. Dix. Classifying semantics of logic programs. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, Proceedings 1st International Workshop on Logic Programming and Nonmonotonic Reasoning, pages 166-180, Cambridge, Mass., 1991. MIT Press.
31. W. Drabent and M. Martelli. Strict completion of logic programs. New Generation Computing, 9:69-79, 1991.
32. P. M. Dung. Acyclic disjunctive programs with abductive procedure as proof procedure. In Proc. Int. Conference on Fifth Generation Computer Systems, pages 555-561. ICOT, 1992.
33. P. M. Dung. An argumentation-theoretic foundation for logic programming. J. of Logic Programming, 22:151-177, 1995.
34. P. M. Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-persons games. Artificial Intelligence, 76:321-358, 1995.
35. J. M. Dunn. Intuitive semantics for first-degree entailment and coupled trees. Philosophical Studies, 29:149-168, 1976.
36. F. Fages. Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994.
37. R. Fagin, J. Y. Halpern, and M. Y. Vardi. A nonstandard approach to the logical omniscience problem. Artificial Intelligence, 79, 1995.
38. M. C. Fitting, W. Marek, and M. Truszczyriski. The pure logic of necessitation. Journal of Logic and Computation, 2:349-373, 1992.
39. M. C. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2:295-312, 1985.
40. M. C. Fitting. Bilattices and the theory of truth. Journal of Philosophical Logic, 18:225-256, 1989.
41. M. C. Fitting. Bilattices and the semantics of logic programming. Journal of Logic Programming, 11:91-116, 1991.
42. M. C. Fitting. The family of stable models. Journal of Logic Programming, 17:197-225, 1993.
43. D. M. Gabbay. Investigations in Modal and Tense Logics. D. Reidel, 1976.
44. D. M. Gabbay. Semantical Investigations in Heyting’s Intuitionistic Logic. D. Reidel, 1981.
45. D. M. Gabbay. Fibring Logics. Oxford University Press, 1998.
46. A. Van Gelder and J. S. Schlipf. Commonsense axiomatizations for logic programs. Journal of Logic Programming, 17:161-196, 1993.
47. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. J. ACM, 38:620-650, 1991.
48. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Proc. 5th International Conf./Symp. on Logic Programming, pages 1070-1080, Cambridge, MA, 1988. MIT Press.
49. M. Gelfond and V. Lifschitz. Classical negation and disjunctive databases. New Generation Computing, 9:365-385, 1991.
50. M. Gelfond, V. Lifschitz, H. Przymusiriska, and M. Truszczyriski. Disjunctive defaults. In Proc. Second Int. Conf. on Principles of Knowledge Representation and Reasoning, KR’91, pages 230-237, Cambridge, Mass., 1991.
51. M. Gelfond. Logic programming and reasoning with incomplete information. Annals of Mathematics and Artificial Intelligence, 12:89-116, 1994.
52. E. Giunchiglia, J. Lee, V. Lifschitz, N. McCain, and H. Turner. Nonmonotonic causal theories. Artificial Intelligence, 153:49-104, 2004.
53. A. Grove. Two modelings for theory change. Journal of Philosophical Logic, 17:157-170, 1988.
54. H. E. Hendry. Minimally incomplete sets of Lukasiewiczean truth-functions. Notre Dame Journal of Formal Logic, 24:146-150, 1983.
55. K. Inoue and C. Sakama. Negation as failure in the head. Journal of Logic Programming, 35:39-78, 1998.
56. H. Jakobovits and D. Vermeir. Robust semantics for argumentation frameworks. Journal of Logic and Computation, 9:215-261, 1999.
57. T. Janhunen, I. Niemela, P. Simons, and J.-H. You. Unfolding partiality and disjunctions in stable model semantics. In F. Giunchiglia and B. Selman, editors, Proc. Int. Conference on Principles of Knowledge Representation and Reasoning, KR’00, pages 411-424, Breckenridge, Co., 2000. Morgan Kaufmann.
58. T. Janhunen. Representing autoepistemic introspection in terms of default rules. In Proc. European Conf. on AI, ECAI-96, pages 70-74, Budapest, 1996. John Wiley & Sons.
59. A. C. Kakas and P. Mankarella. Stable theories for logic programs. In V. Saraswat and K. Ueda, editors, Proc. Int. Symp. On Logic Programming, pages 85-100. MIT Press, 1991.
60. A. C. Kakas and F. Toni. Computing argumentation in logic programming. Journal of Logic and Computation, 9:515-562, 1999.
61. A. C. Kakas, P. Mancarella, and P. M. Dung. The acceptability semantics for logic programs. In P. Van Hentenryck, editor, Proceedings Int. Conf. on Logic Programming, ICLP-94, pages 504-519, Camb., MA, 1994. MIT Press.
62. K. Konolige. On the relation between default and autoepistemic logic. Artificial Intelligence, 35:343-382, 1988.
63. K. Konolige. Abduction versus closure in causal theories. Artificial Intelligence, 53:255-272, 1992.
64. K. Konolige. Using default and causal reasoning in diagnosis. Annals of Mathematics and Artificial Intelligence, 11:97-135, 1994.
65. S. Kraus, D. Lehmann, and M. Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44:167-207, 1990.
66. T. Langholm. How different is partial logic? In P. Doherty, editor, Partiality, Modality, and Nonmonotonicity, pages 3-43. CSLI, Stanford, 1996.
67. J. Lee and V. Lifschitz. Loop formulas for disjunctive logic programs. In Proc. Nineteenth Int. Conference on Logic Programming, pages 451-465 2003.
68. J. Lee. Nondefinite vs. definite causal theories. In V. Lifschitz and I. Niemela, editors, Proc. 1th Int. Ciemela, editors, Proc. 1th Int. Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2004, pages 141-153, Fort Lauderdale, FL, USA, 2004. Springer. LNAI 2923.
69. D. Lehmann. Another perspective on default reasoning. Annals of Mathematics and Artificial Intelligence, 15:61-82, 1995.
70. W. Lenzen. Epistemologische betrachtungen zu [s4, s5]. Erkenntnis, 14:33-56, 1979.
71. V. Lifschitz and G. Schwarz. Extended logic programs as autoepistemic theories. In L. M. Pereira and A. Nerode, editors, Proc. Second Int. Workshop on Logic Programming and Nonmonotonic Reasoning, pages 101-114. MIT Press, 1993.
72. V. Lifschitz and T. Woo. Answer sets in general nonmonotonic reasoning (preliminary report). In Proc. Third Int. Conf. on Principles of Knowledge Representation and Reasoning, KR’92, pages 603-614. Morgan Kauffman, 1992.
73. V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541, 2001.
74. V. Lifschitz. Computing circumscription. In Proc. 9th Int. Joint Conf. on Artificial Intelligence, IJCAI-85, pages 121-127. Morgan Kaufmann, 1985.
75. V. Lifschitz. Pointwise circumscription. In M. Ginsberg, editor, Readings in Non-Monotonic Reasoning, pages 179-193. Morgan Kaufmann, San Mateo, CA, 1987.
76. V. Lifschitz. Minimal belief and negation as failure. Artificial Intelligence, 70:53-72, 1994.
77. F. Lin and Y. Shoham. A logic of knowledge and justified assumptions. Artificial Intelligence, 57:271-289, 1992.
78. F. Lin and Y. Zhao. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proceedings AAAI-02, 2002.
79. J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. Journal of Logic Programming, 11:217-242, 1991.
80. J. Lloyd and R. Topor. Making Prolog more expressive. Journal of Logic Programming, 3:225-24, 1984.
81. J. Lobo and C. Uzcategui. Abductive consequence relations. Artificial Intelligence, 89:149-171, 1997.
82. J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, Mass., 1992.
83. D. Makinson and L. van der Torre. Input/Output logics. Journal of Philosophical Logic, 29:383-408, 2000.
84. D. Makinson. General theory of cumulative inference. In M. Reinfrank, editor, Nonmonotonic Reasoning, volume 346 of LNAI, pages 1-18. Springer, 1989.
85. W. Marek and M. Truszczyriski. Relating autoepistemic and default logics. In Int. Conf. on Principles of Knowledge Representation and Reasoning, KR’89, pages 276-288, San Mateo, Calif., 1989. Morgan Kaufmann.
86. W. Marek and M. Truszczyriski. Nonmonotonic Logic, Context-Dependent Reasoning. Springer, 1993.
87. W. Marek, A. Nerode, and J. Remmel. A theory of nonmonotonic rule systems. Annals of Mathematics and Artificial Intelligence, 1:241-273, 1990.
88. V. W. Marek, G. F. Schwarz, and M. Truszchinski. Modal nonmonotonic logics:ranges, characterization, computation. Journal of ACM, 40:963-990, 1993.
89. N. McCain and H. Turner. Causal theories of action and change. In Proceedings AAAI-91, pages 460-465 1997.
90. N. McCain. Causality in Commonsense Reasoning About Actions. PhD thesis, University of Texas at Austin, 1997.
91. D. McDermott and J. Doyle. Nonmonotonic logic. Artificial Intelligence, 13:41-72, 1980.
92. D. McDermott. NcDermott. Nonmonotonic logic II: Nonmonotonic modal theories. Journal of the ACM, 29:33-57, 1982.
93. R. C. Moore. Semantical considerations on non-monotonic logic. Artificial Intelligence, 25:75-94, 1985.
94. R. Muskens. On partial and paraconsistent logics. Notre Dame Journal of Formal Logic, 40:352-374, 1999.
95. I. Niemela. A unifying framework for nonmonotonic reasoning. In Proc. 10th European Conference on Artificial Intelligence, ECAI-9S, pages 334-338, Vienna, 1992. John Wiley.
96. D. Pearce. A new logical characterization of stable models and answer sets. In J. Dix, L. M. Pereira, and T. Przymusinski, editors, Non-Monotonic Extensions of Logic Programming, volume 1216 of LNAI, pages 57-70. Springer, 1997.
97. J. Pearl. Embracing causality in formal reasoning. In Proceedings AAAI-87, pages 369-373, Seattle, 1987.
98. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
99. D. Poole. Explanation and prediction: An architecture for default and abductive reasoning. Computational Intelligence, 5:97-110, 1989.
100. D. Poole. A methodology for using a default and abductive reasoning system. Int. Journal of Intelligent Systems, 5:521-548, 1990.
101. D. Poole. Representing diagnosis knowledge. Annals of Mathematics and Artificial Intelligence, 11:33-50, 1994.
102. H. Przymusinska and T. Przymusinski. Semantic issues in deductive databases and logic programs. In R. Benerji, editor, Formal Techniques in Artificial Intelligence, pages 321-367. North-Holland, Amsterdam, 1990.
103. T. C. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, 13:445-464, 1990.
104. T. C. Przymusinski. Semantics of disjunctive logic programs and deductive databases. In Proc. Second Int. Conf. On Deductive and Object-Oriented Databases, pages 85-107. Springer, 1991.
105. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401-424, 1991.
106. T. C. Przymusinski. Semantics of normal and disjunctive programs: A unifying framework. In J. Dix, L. Pereira, and T. Przymusinski, editors, Proc. Wn J. Dix, L. Pereira, and T. Przymusinski, editors, Proc. Workshop on Non-Monotonic Extensions of Logic Programming, pages 43-67. Springer, 1995. LNAI.
107. T. C Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 1995.
108. R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 119-140. Plenum Press, 1978.
109. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81-132, 1980.
110. R. Reiter. The frame problem in the situation calculus: A simple solution (some times) and a completeness result for goal regression. In V. Lifschitz, editor, Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of Lohn McCarthy, pages 318-420. Academic Press, 1991.
111. R. Reiter. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamic Systems. MIT Press, 2001.
112. R. Routley, V. Plumwood, R. Meyer, and R. Brady. Relevant Logics and their Rivals. Ridgeview, Ca., 1982.
113. C Sakama and H. Seki. Partial deduction of disjunctive logic programs: A declarative approach. In L. Fribourg and F. Turini, editors, Logic Program Synthesis and Transformation-Meta-Programming in Logic, volume 883 of LNCS, pages 170-181. Springer, 1994.
114. M. Schaerf. Negation and minimality in disjunctive databases. Journal of Logic Programming, 23:63-86, 1995.
115. J. S. Schlipf. Formalizing a logic for logic programming. Annals of Mathematics and Artificial Intelligence, 5:279-302, 1992.
116. L. K. Schubert. Explanatory closure, action closure and the Sandewall test suite for reasoning about change. Journal of Logic and Computation, 4:679-700, 1994.
117. G. Schwarz and M. Truszczyński. Mruszczyński. Minimal knowledge problem: a new approach. Artificial Intelligence, 67:113-141, 1994.
118. G. Schwarz. Autoepistemic modal logics. In R. Parikh, editor, Theoretical Aspects of Reasoning about Knowledge, TARK-90, pages 97-109, San Mateo, CA, 1990. Morgan Kaufmann.
119. G. Schwarz. Minimal model semantics for nonmonotonic modal logics. In Proceedings LICS-92, pages 34-43, Santa Cruz, CA., 1992.
120. G. Schwarz. Reflexive autoepistemic logic. Fundamenta Informaticae, 17:157-173, 1992.
121. D. Scott. Completeness and axiomatizability in many-valued logic. In Proc. Symp. In Pure Math., No. 25, pages 431-435 1974.
122. K. Segerberg. An Essay in Classical Modal Logic, volume 13 of Filosofiska Studier. Uppsala University, 1971.
123. K. Segerberg. Classical Propositional Operators. Clarendon Press, 1982.
124. M. P. Shanahan. Solving the Frame Problem. The MIT Press, 1997.
125. J. C. Shepherdson. Negation in logic programming. In J. Minker, editor, Deductive Databases and Logic Programming, pages 19-88. M. Kaufmann, 1988.
126. D. J. Shoesmith and T. J. Smiley. Multiple-Conclusion Logic. Cambridge University Press, 1978.
127. Y. Shoham. Reasoning about Change. Cambridge University Press, 1988.
128. R. F. Stärk. Ftärk. From logic programs to inductive definitions. In W. A. Hodges et al., editors, Logic: From Foundations to Applications, European Logic Colloquium’93, pages 453-481, Oxford, 1996. Clarendon Press.
129. M. Thielscher. Ramification and causality. Artificial Intelligence, 89:317-364, 1997.
130. M. Tiomkin and M. Kaminski. Nonmonotonic default modal logics. Journal of the ACM, 38:963-984, 1991.
131. M. Truszczyński. Eruszczyński. Embedding default logic into modal nonmonotonic logics, pages 151-165, Cambridge Mass., 1991. The MIT Press.
132. M. Truszczyński. Mruszczyński. Modal interpretations of default logic. In J. Myopoulos and R. Reiter, editors, Proceedings Int. Joint Conf. on Artificial Intelligence, IJCAP91, pages 393-398, San Mateo, Calif., 1991. Morgan Kaufmann.
133. H. Turner. A logic of universal causation. Artificial Intelligence, 113:87-123, 1999.
134. H. Turner. Strong equivalence for causal theories. In V. Lifschitz and I. Niemela, editors, Proc. Int. Conf. on Logic Programming and Nonmonotonic Reasoning, LPNMR 2004, volume 2923 of LNAI, pages 289-301, Fort Lauderdale, FL, 2004. Springer.
135. J Van Benthem. A Manual of Intensional Logic. CSLI, Stanford, second edition, 1988.
136. M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. J. of ACM, 23:733-742, 1976.
137. M. Wallace. Tight, consistent, and computable completions for unrestricted logic programs. Journal of Logic Programming, 15:243-273, 1993.
138. L. Wittgenstein. Tractatus Logico-Philosophicus. Routledge & Kegan Paul, London, 1961. English translation by D. F. Pears and B. F. McGuinness.
139. L. Y. Yuan and J.-H. You. Autoepistemic circumscription and logic programming. J. of Automated Reasoning, 10:143-160, 1993.