Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
In this paper we argue that for realistic applications involving default reasoning it is necessary to reason about the priorities of defaults. Existing approaches require the know...
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expres...
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...