William W. Cohen ATT Bell Laboratories 600 Mountain Avenue Murray Hill, NJ...  Home/Search
Context Related
| cmu.edu/~wcohen/post...aaai94local.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~wcohen/postscript/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Context of citations to this paper: More
...i so that they are all disjoint, and let C be the clause A B 1 : B r This leads to the following result. For a detailed proof, see [Cohen, 1994b] 27 Theorem 16 Let L k LENGTH DUAL [B] be the language of logic programs C such that M(C) M(fP 1 g) M(fP r g) where...
...that they are all disjoint, and let C be the clause A B 1 : B r This leads to the following result. For a detailed proof, see [ Cohen, 1994b ] 28 [B] be the language of logic programs C such that M(C) M(fP 1 g) M(fP r g) where P 1 , P r are...
Cited by: More
Inductive Specification Recovery: - Understanding Software By (Correct)
Pac-Learning Non-Recursive Prolog Clauses - William Cohen Att (1995) (Correct)
The Pac-Learnability of Recursive Logic Programs - William Cohen Att (1994) (Correct)
Similar documents based on text: More All
1.3: Rapid Prototyping of ILP Systems Using Explicit Bias - Cohen (1993) (Correct)
1.2: Cryptographic Limitations on Learning One-Clause Logic Programs - Cohen (1993) (Correct)
1.1: Learning Logic Programs with Random Classification Noise - Horváth, Sloan, Turán (1996) (Correct)
Related documents from co-citation: More All
9: Learning Logical Definitions from Relations (context) - Quinlan - 1990
6: FOIL: A midterm report - Quinlan, Cameron-Jones - 1993
6: Cryptographic limitations on learning one-clause logic programs - William, Cohen - 1993
BibTeX entry: (Update)
William W. Cohen. Pac-learning nondeterminate clauses. In Proceedings of the Eleventh National Conference on Artificial Intelligence, Seattle, WA, 1994. http://citeseer.ist.psu.edu/article/cohen94paclearning.html More
@inproceedings{ cohen94paclearning,
author = "William W. Cohen",
title = "Pac-Learning Nondeterminate Clauses",
booktitle = "National Conference on Artificial Intelligence",
pages = "676-681",
year = "1994",
url = "citeseer.ist.psu.edu/article/cohen94paclearning.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-2.cs.cmu.edu/~wcohen/postscript/): More
Probabilistic Hill-Climbing - Cohen, Greiner, Dale (1991) (Correct)
Desiderata for Generalization-to-N Algorithms - Cohen (1994) (Correct)
Polynomial Learnability and Inductive Logic Programming.. - Cohen, Page, Jr. (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC