ML Anthology

Inductive Resolution

Taisuke Sato, Sumitaka Akiba
ALT 1993 pp. 101-110
doi:10.1007/3-540-57370-4_40 /alt/1993/sato1993alt-inductive/

Abstract

A clausal system IDR for inductive inference is proposed. Given back-ground knowledge ß and an observed fact B , each represented in terms of clauses, it infers a set H of clauses such that ß ∪ H ⊢ O . It is inductively complete , i.e., can find every possible H regardless of whether O = □ or not. When hypothesis generation is suppressed, it simulates OL-deduction

PDF ALT Semantic Scholar

Cite

Text

Sato and Akiba. "Inductive Resolution." International Conference on Algorithmic Learning Theory, 1993. doi:10.1007/3-540-57370-4_40

Markdown

[Sato and Akiba. "Inductive Resolution." International Conference on Algorithmic Learning Theory, 1993.](https://mlanthology.org/alt/1993/sato1993alt-inductive/) doi:10.1007/3-540-57370-4_40

BibTeX

@inproceedings{sato1993alt-inductive,
  title     = {{Inductive Resolution}},
  author    = {Sato, Taisuke and Akiba, Sumitaka},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1993},
  pages     = {101-110},
  doi       = {10.1007/3-540-57370-4_40},
  url       = {https://mlanthology.org/alt/1993/sato1993alt-inductive/}
}