Alternative foundations for Reiter's default logic

Artificial Intelligence

Volumn 124, Issue 1, 2000, Pages 31-86

  Linke, Thomas ^a   Schaub, Torsten ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DECISION THEORY; FORMAL LOGIC; GRAPH THEORY; PROBLEM SOLVING; THEOREM PROVING;

BLOCK GRAPHS; NONMONOTONIC REASONING; REITER DEFAULT LOGICS;

KNOWLEDGE REPRESENTATION;

EID: 0034324325     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00060-6     Document Type: Article

References (48)

1. Antoniou G. Non-Monotonic Reasoning. 1998;MIT Press, Cambridge, MA.
2. Besnard P. An Introduction to Default Logic, Symbolic Computation - Artifical Intelligence. 1989;Springer, Berlin.
3. Bonatti P. Proof systems for default and autoepistemic logic. Miglioli P., Moscato U., Mundici D., Ornaghi M. Proc. Tableaux'96. Lecture Notes in Artificial Intelligence. 1996;127-142 Springer, Berlin.
4. Bonatti P., Olivetti N. A sequent calculus for skeptical default logic. Galmiche D. Proc. Tableaux'97. Lecture Notes in Artificial Intelligence. 1997;107-121 Springer, Berlin.
5. Bondarenko A., Dung P., Kowalski R., Toni F. An abstract, argumentation-theoretic approach to default reasoning. Artificial Intelligence. Vol. 93:(1-2):1997;63-101.
6. Brewka G. Cumulative default logic: In defense of nonmonotonic inference rules. Artificial Intelligence. Vol. 50:(2):1991;183-205.
7. Brewka G. Nonmonotonic Reasoning: Logical Foundations of Commonsense. 1991;Cambridge University Press, Cambridge.
8. Cadoli M., Donini F., Schaerf M. Is intractability of nonmonotonic reasoning a real drawback. Proc. AAAI-94, Seattle, WA. 1994;946-951 AAAI Press/MIT Press.
9. Ceri S., Gottlob G., Tanca L. Logic Programming and Databases. 1990;Springer, Berlin.
10. Cholewiński P. Reasoning with stratified default theories. Marek V., Nerode A. Proc. 3rd International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science. 1995;273-286 Springer, Berlin.
11. Cholewiński P., Marek V., Mikitiuk A., Truszczyński M. Experimenting with nonmonotonic reasoning. Sterling L. Proc. International Conference on Logic Programming. 1995;267-281 MIT Press, Cambridge, MA.
12. Cholewiński P., Marek V., Truszczyński M. Default reasoning system DeReS. Proc. 5th International Conference on the Principles of Knowledge Representation and Reasoning (KR-96), Cambridge, MA. 1996;518-528 Morgan Kaufmann, San Mateo, CA.
13. Ciorba V. A query answering algorithm for Lukaszewicz' general open default theory. Alferes J., Pereira L., Orlowska E. 5th European Workshop on Logics in Artificial Intelligence. Lecture Notes in Artificial Intelligence. 1996;208-223 Springer, Berlin.
14. Davis M., Putnam H. A computing procedure for quantification theory. J. ACM. Vol. 7:1960;201-215.
15. Delgrande J., Schaub T. Compiling specificity into approaches to nonmonotonic reasoning. Artificial Intelligence. Vol. 90:(1-2):1997;301-348.
16. Delgrande J., Schaub T., Jackson W. Alternative approaches to default logic. Artificial Intelligence. Vol. 70:(1-2):1994;167-237.
17. Dimopoulos Y., Magirou V. A graph-theoretic approach to default logic. Inform. and Comput. Vol. 112:1994;239-256.
18. Dimopoulos Y., Torres A. Graph theoretical structures in logic programs and default theories. Theoret. Comput. Sci. Vol. 170:1996;209-244.
19. Dung P. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n -person games. Artificial Intelligence. Vol. 77:(2):1995;222-238.
20. Etherington D. Reasoning with incomplete information: Investigations of non-monotonic reasoning, Ph.D. Thesis. 1986;Department of Computer Science, University of British Columbia, Vancouver, BC. Revised version appeared in: Research Notes in AI, Pitman, London.
21. Etherington D. Formalizing nonmonotonic reasoning. Artificial Intelligence. Vol. 31:1987;41-85.
22. Fitting M., Marek V., Truszczyński M. The pure logic of necessitation. J. Logic Comput. Vol. 2:1992;349-373.
23. Froidevaux C., Mengin J. Default logic: A unified view. Computational Intelligence. Vol. 10:(3):1994;331-369.
24. Gogic G., Kautz H., Papadimitriou C., Selman B. The comparative linguistics of knowledge representation. Mellish C. Proc. IJCAI-95, Montreal, Quebec. 1995;862-869 Morgan Kaufmann, San Mateo, CA.
25. Gottlob G. Complexity results for nonmonotonic logics. J. Logic Comput. Vol. 2:(3):1992;397-425.
26. Junker U., Konolige K. Computing the extensions of autoepistemic and default logic with a TMS. Proc. AAAI-90, Boston, MA. 1990;278-283 AAAI Press/MIT Press.
27. Kakas A., Toni F. Computing argumentation in logic programming. J. Logic Comput. Vol. 9:1999;515-562.
28. Lévy F. Computing extensions of default theories. Kruse R., Siegel P. Proc. European Conference on Symbolic and Quantitative Approaches for Uncertainty. Lecture Notes in Computer Science. 1991;219-226 Springer, Berlin.
29. Linke T. New foundations for automation of default reasoning, Dissertation. 1999;University of Bielefeld. Revised version appeared at: Akademische Verlags-Gesellschaft, 2000.
30. Linke T., Schaub T. An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem. Dix J., Fariñas del Cerro L., Furbach U. Proc. 6th European Workshop on Logics in Artificial Intelligence. Lecture Notes in Artificial Intelligence. 1998;233-247 Springer, Berlin.
31. Linke T., Schaub T. Default reasoning via blocking sets. Gelfond M., Leone N., Pfeifer G. Proc. 5th International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Artificial Intelligence. 1999;247-261 Springer, Berlin.
32. Linke T., Schaub T. New foundations for reasoning with reiter's default logic. 1999;Technical Report, Institute of Informatics, University of Potsdam.
33. Linke T., Schaub T. On bottom-up pre-processing techniques for automated default reasoning. Hunter A., Parsons S. Proc. 5th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty. Lecture Notes in Artificial Intelligence. 1999;268-278 Springer, Berlin.
34. Lukaszewicz W. Considerations on default logic - An alternative approach. Computational Intelligence. Vol. 4:1988;1-16.
35. Marek V., Truszczyński M. Nonmonotonic Logic: Context-Dependent Reasoning. Artifical Intelligence. 1993;Springer, Berlin.
36. McCarthy J. Circumscription - A form of nonmonotonic reasoning. Artificial Intelligence. Vol. 13:(1-2):1980;27-39.
37. Mengin J. Prioritized conflict resolution for default reasoning. Proc. European Conference on Artificial Intelligence, Amsterdam. 1994;376-380.
38. Niemelä I. Towards efficient default reasoning. Mellish C. Proc. IJCAI-95, Montreal, Quebec. 1995;312-318 Morgan Kaufmann, San Mateo, CA.
39. Papadimitriou C., Sideri M. Default theories that always have extensions. Artificial Intelligence. Vol. 69:1994;347-357.
40. Reiter R. A logic for default reasoning. Artificial Intelligence. Vol. 13:(1-2):1980;81-132.
41. Reiter R., Criscuolo G. On interacting defaults. Proc. IJCAI-81, Vancouver, BC. 1981;270-276.
42. Richardson M. Solutions of irreflexive relations. Ann. Math. Vol. 3:1953;573-590.
43. Risch V. Analytic tableaux for default logics. J. Appl. Non-Classical Logics. Vol. 6:(1):1996;71-88.
44. Schaub T. A new methodology for query-answering in default logics via structure-oriented theorem proving. J. Automat. Reason. Vol. 15:(1):1995;95-165.
45. Schwarz G., Truszczyński M. Subnormal modal logics for knowledge representation. Proc. AAAI-93, Washington, DC. 1993;438-443 AAAI Press/MIT Press.
46. Schwind C. A tableaux-based theorem prover for a decidable subset of default logic. Stickel M. Proc. Conference on Automated Deduction. 1990;528-542 Springer, Berlin.
47. Schwind C., Risch V. Tableau-based characterization and theorem proving for default logic. J. Automat. Reason. Vol. 13:1994;223-242.
48. Zhang A., Marek V. On the classification and existence of structures in default logic. Fundamenta Informaticae. Vol. 8:(4):1990;485-499.