Abstract
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically explains a set of examples with respect to a prior background theory. Currently, CF-induction computes hypotheses by applying combinations of several complex generalisation operators to an intermediate theory called a bridge formula. In this paper we propose an alternative approach whereby hypotheses are derived from a bridge formula using a single deductive operator and a single inductive operator. We show that our simplified procedure preserves the soundness and completeness of CF-induction.
| Translated title of the contribution | Towards a Logical Reconstruction of CF-Induction |
|---|---|
| Original language | English |
| Title of host publication | New Frontiers in Artificial Intelligence: JSAI 2007 Conference and Workshop Revised Selected Papers (from 5th Workshop on Learning with Logics and Logics for Learning) |
| Publisher | Springer |
| Publication status | Published - 2008 |
Bibliographical note
Other page information: 330-343Conference Proceedings/Title of Journal: New Frontiers in Artificial Intelligence: JSAI 2007 Conference and Workshop Revised Selected Papers (from 5th Workshop on Learning with Logics and Logics for Learning)
Other identifier: 2000832