Abstract
Our book has two main themes: nonmonotonic formalisms based on the language of propositional logic (default logic and logic programming and its extensions fall into this category) and modal nonmonotonic logics. Until now we have not discussed the question of interconnections between them. We will do so in this chapter. First, we will show that several modal nonmonotonic logics studied in Chapter 7 can be regarded as generalizations of default logic. An important consequence of this result is yet another semantical characterization of extensions. Even stronger results can be obtained for logic programming and, in particular, new characterizations of stable models for logic programs and stable answer sets for logic programs with classical negation are presented. Next, we show that default logic with weak extensions naturally corresponds to autoepistemic logic (that is, the nonmonotonic logic kd45). Finally, we introduce the notion of truth maintenance and briefly discuss its relation to logic programming and modal nonmonotonic logics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Marek, V.W., Truszczyński, M. (1993). Relations among nonmonotonic formalisms. In: Nonmonotonic Logic. Artificial Intelligence. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02906-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-02906-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-02908-4
Online ISBN: 978-3-662-02906-0
eBook Packages: Springer Book Archive