This paper proposes a method to learn from a set of examples a theory expressed in default logic, more precisely in Lukaszewicz’default logic. The main characteristic of our method is to deal with theories where the definitions of a predicate p and definitions for its negation :p are explicitly and simultaneously learned. This method relies on classical generalization techniques proposed in the field of Inductive Logic Programming and on the notion of credulous/skeptical theorem in Default Logic.
CITATION STYLE
Duval, B., & Nicolas, P. (1999). Learning default theories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1638, pp. 148–159). Springer Verlag. https://doi.org/10.1007/3-540-48747-6_14
Mendeley helps you to discover research relevant for your work.