ML Anthology

Pac-Learning Nondeterminate Clauses

William W. Cohen
AAAI 1994 pp. 676-681
/aaai/1994/cohen1994aaai-pac/

Abstract

Several practical inductive logic programming systems efficiently learn "determinate" clauses of constant depth. Recently it has been shown that while nonrecursive constant-depth determinate clauses are pac-learnable, most of the obvious syntactic generalizations of this language are not pac-learnable. In this paper we introduce a new restriction on logic programs called "locality", and present two formal results. First, the language of nonrecursive clauses of constant locality is pac-learnable. Second

PDF AAAI Semantic Scholar

Cite

Text

Cohen. "Pac-Learning Nondeterminate Clauses." AAAI Conference on Artificial Intelligence, 1994.

Markdown

[Cohen. "Pac-Learning Nondeterminate Clauses." AAAI Conference on Artificial Intelligence, 1994.](https://mlanthology.org/aaai/1994/cohen1994aaai-pac/)

BibTeX

@inproceedings{cohen1994aaai-pac,
  title     = {{Pac-Learning Nondeterminate Clauses}},
  author    = {Cohen, William W.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1994},
  pages     = {676-681},
  url       = {https://mlanthology.org/aaai/1994/cohen1994aaai-pac/}
}