ML Anthology

Completeness for Inductive Procedures

Céline Rouveirol
ICML 1991 pp. 452-456
doi:10.1016/B978-1-55860-200-7.50093-3 /icml/1991/rouveirol1991icml-completeness/

Abstract

This paper presents an extension of the inverse resolution framework, which is a logical model of theory induction in first order logic. We first propose a formal model of inversion of logical entailment that extends the well known inverse resolution framework. Two operators are formalized that implement this framework and we prove that they are complete, according to a definition that follows naturally from our framework. In the last part of the paper, we compare our approach mainly with CIGOL and its sucessor GOLEM.

ICML Semantic Scholar

Cite

Text

Rouveirol. "Completeness for Inductive Procedures." International Conference on Machine Learning, 1991. doi:10.1016/B978-1-55860-200-7.50093-3

Markdown

[Rouveirol. "Completeness for Inductive Procedures." International Conference on Machine Learning, 1991.](https://mlanthology.org/icml/1991/rouveirol1991icml-completeness/) doi:10.1016/B978-1-55860-200-7.50093-3

BibTeX

@inproceedings{rouveirol1991icml-completeness,
  title     = {{Completeness for Inductive Procedures}},
  author    = {Rouveirol, Céline},
  booktitle = {International Conference on Machine Learning},
  year      = {1991},
  pages     = {452-456},
  doi       = {10.1016/B978-1-55860-200-7.50093-3},
  url       = {https://mlanthology.org/icml/1991/rouveirol1991icml-completeness/}
}