|1. Lecture:||General Nonmonotonic Logics |
We will first discuss the main nonmonotonic logics like Default Logic, Circumscription and Autoepistemic Logic and put them in a perspective for Knowledge Representation.
|2. Lecture:||Automating Nonmonotonic Logics |
We show how the usually infinite objects in nonmonotonic logics can be cut down to finitary ones and thus are available for further handling. We illustrate that there are two orthogonal sources of complexity that have to be considered for the design of efficient implementations.
|3. Lecture:||Nonmonotonic Semantics of LP: I |
Starting from Relational Databases and definite logic programs, we will discuss negation-as-finite-failure and the need for introducing nonmonotonic negation. We also investigate bottom-up vs top-down techniques and the influence of the underlying Herbrand domain.
|4. Lecture:||Nonmonotonic Semantics of LP: II|
Here we introduce the stable and the wellfounded semantics and illustrate their relationship and various extensions. These semantics are then extended to arbitrary disjunctive programs with negation.
|5. Lecture:||Complexity, Expressibility and Implementation|
We discuss the various complexity and expressibility classes that can be captured by the different semantics and also by general nonmonotonic logics. We also give some hints for successful implementations and point to systems currently developed.
Benchmarks and Systems|
Here we present some applications of nonmonotonic reasoning and stable models, eg. to planning and diagnosis. This leads to interesting benchmarks. We also give an overview of the systems currently deloped and available.