Normal form results for default logic
Part of the Lecture Notes in Computer Science book series (LNCS, volume 659)
In this paper we continue investigations of proof theory of default logic. It turns out that, similarly to classical logic, default theories can be represented in normal forms.
Unable to display preview. Download preview PDF.
- [Eth88]D. W. Etherington. Reasoning with Incomplete Information. Pitman, London, 1988.Google Scholar
- [Fit90]M. C. Fitting. First Order Logic and Automated Theorem Proving. Springer Verlag, 1990.Google Scholar
- [Men64]E. Mendelson. Introduction to Mathematical Logic. Van Nostrand Reinhold, 1964.Google Scholar
- [MT89]W. Marek and M. Truszczyński. Relating autoepistemic and default logics. In Principles of Knowledge Representation and Reasoning, pages 276–288, San Mateo, CA., 1989. Morgan Kaufmann.Google Scholar
- [MT93]W. Marek and M. Truszczynski. Nonmonotonic Logics; Context-Dependent Reasoning, to appear.Google Scholar
- [Rei80]R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.Google Scholar
- [YBB92]F. Yang, H. Blair, and A. Brown. Programming in default logic. University of Syracuse, 1992.Google Scholar
© Springer-Verlag Berlin Heidelberg 1993