Abstract
Publisher Summary Non-monotonic reasoning is the modern name for a variety of scientific activities that are characterized by the idea that the traditional deductive approach to inference systems is too narrow for many applications and that new formalisms are required that make arrangements for default reasoning, common sense reasoning, and autoepistemic reasoning. The recent interest in this field is caused by questions in artificial intelligence (AI) and computer science, which has led to a series of ad hoc methods and isolated case studies. This chapter reviews connections between the sets of formulae and individual formulae. The chapter discusses the forms of non-monotonic reasoning that are induced by default operators. In addition, closed-world assumption (CWA) is also discussed. Advantages of the CWA are its clear methodological conception and its efficiency for elementary database. Disadvantages are the restricted range of applicability and its complicated proof procedure.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Studies in Logic and the Foundations of Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.