We present in this paper a framework to learn general logic programs, i.e., sets of rules which may contain negation in their bodies. It is based on a three-valued logic (ftrue, false, undeened g) that enables to model both the notion of unknown information and the notion of undeened answer of the Prolog interpreter. In this framework, the usual notions of… (More)
Figures and Tables
Sorry, we couldn't extract any figures or tables for this paper.