Nonmonotonic reasoning: Towards efficient calculi and implementations (Q2751371)

The main nonmonotonic logics (the basis of most nonmonotonic reasoning systems that are in use today): default logic, circumscription and autoepistemic logic are considered. The abstract approach of Kraus, Lehmann and Magidor and universal methods for computing in nonmonotonic logics are investigated. This is done with a special eye on the underlying complexity and it is shown how this can lead to automated theorem proving in such logics. Techniques of efficient inference, originated from automated reasoning in the first-order predicate calculus, are applied for disjunctive logic programming with programs with variables but only limited use of negation. Nonmonotonic semantics of logic programs with negation and disjunction are introduced. Polynomial space implementations of D-WFS and D-STABLE are suggested. Several web-pages about nonmonotonic aspects of logic programming are recommended.NEWLINENEWLINEFor the entire collection see [Zbl 0964.00020].