Asking questions to minimize errors
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On learning Read-k-Satisfy-j DNF
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning with queries but incomplete information (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning from a consistently ignorant teacher
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Generalized teaching dimensions and the query complexity of learning
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
How many queries are needed to learn?
Journal of the ACM (JACM)
A dichotomy theorem for learning quantified Boolean formulas
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Learning from examples with unspecified attribute values (extended abstract)
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Learning first order universal Horn expressions
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Exact learning of tree patterns from queries and counterexamples
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
The query complexity of finding local minima in the lattice
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On theory revision with queries
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
A Dichotomy Theorem for Learning Quantified Boolean Formulas
Machine Learning - Special issue: computational learning theory, COLT '97
More theory revision with queries (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Learning Function-Free Horn Expressions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
The query complexity of finding local minima in the lattice
Information and Computation
How to upgrade propositional learners to first order logic: case study
Relational Data Mining
Remarks on computational learning theory
Annals of Mathematics and Artificial Intelligence
Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression
IEEE Transactions on Knowledge and Data Engineering
Translation among CNFs, characteristic models and ordered binary decision diagrams
Information Processing Letters
Informed Selection of Training Examples for Knowledge Refinement
EKAW '00 Proceedings of the 12th European Workshop on Knowledge Acquisition, Modeling and Management
Learning in Clausal Logic: A Perspective on Inductive Logic Programming
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Learning Range Restricted Horn Expressions
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Learnability of Quantified Formulas
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
How to Upgrade Propositional Learners to First Order Logic: A Case Study
Machine Learning and Its Applications, Advanced Lectures
Logical Aspects of Several Bottom-Up Fittings
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Boolean Formulas are Hard to Learn for most Gate Bases
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Learning Minimal Covers of Functional Dependencies with Queries
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Learning Intermediate Concepts
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
A Theory of Hypothesis Finding in Clausal Logic
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Learnability of quantified formulas
Theoretical Computer Science
An efficient algorithm for Horn description
Information Processing Letters
Theory revision with queries: horn, read-once, and parity formulas
Artificial Intelligence
Learning a circuit by injecting values
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Polynomial certificates for propositional classes
Information and Computation
The Journal of Machine Learning Research
Learning Horn Expressions with LOGAN-H
The Journal of Machine Learning Research
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
Query Learning and Certificates in Lattices
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Learning a circuit by injecting values
Journal of Computer and System Sciences
Horn Query Learning with Multiple Refinement
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Combinatorial Problems for Horn Clauses
Graph Theory, Computational Intelligence and Thought
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
Learning conditional preference networks with queries
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Polynomial certificates for propositional classes
Information and Computation
Learning large-alphabet and analog circuits with value injection queries
COLT'07 Proceedings of the 20th annual conference on Learning theory
Learning conditional preference networks
Artificial Intelligence
Canonical horn representations and query learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Learnability in inductive logic programming: some basic results and techniques
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
On approximate horn formula minimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
On learning multivalued dependencies with queries
Theoretical Computer Science
Learning a subclass of k-quasi-Horn formulas with membership queries
Information Processing Letters
Learning first-order definite theories via object-based queries
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
Proceedings of the 15th International Conference on Database Theory
Negative results on learning multivalued dependencies with queries
Information Processing Letters
On the gap between ess(f) and cnf_size(f)
Discrete Applied Mathematics
Hydras: directed hypergraphs and horn formulas
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
ACM Transactions on Database Systems (TODS) - Invited papers issue
| Hi-index | 0.00 |
An algorithm is presented for learning the class of Boolean formulas that are expressible as conjunctions of Horn clauses. (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.