Abstract
In this chapter we investigate the complexity of some forms of nonmonotonic reasoning. We assume familiarity with basic notions of the computational complexity theory and the recursion theory. Definitions of some of these concepts are provided in the first section of this chapter. For the undefined concepts the reader is referred to Garey and Johnson [GJ79] and Rogers [Rog87].
This is a preview of subscription content, log in via an institution to check access.
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). Complexity of some forms of nonmonotonic reasoning. In: Nonmonotonic Logic. Artificial Intelligence. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02906-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-662-02906-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-02908-4
Online ISBN: 978-3-662-02906-0
eBook Packages: Springer Book Archive