AAAI Conference 1993 Conference Paper
Learnability in Inductive Logic Programming: Some Basic Results and Techniques
- Michael Frazier
Author name cluster
Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.
AAAI Conference 1993 Conference Paper
ICML Conference 1993 Conference Paper
FOCS Conference 1990 Conference Paper
An algorithm for learning the class of Boolean formulas that are expressible as conjunctions of Horn clauses is presented. (A Horn clause is a disjunction of literals, all but at most one of which is a negated variable). The algorithm uses equivalence queries and membership queries to produce a formula that is logically equivalent to the unknown formula to be learned. The amount of time used by the algorithm is polynomial in the number of variables and the number of clauses in the unknown formula. >