Learning conjunctions of Horn clauses
From MaRDI portal
Publication:1207302
zbMath0766.68107MaRDI QIDQ1207302
Michael Frazier, Dana Angluin, Leonard Pitt
Publication date: 1 April 1993
Published in: Machine Learning (Search for Journal in Brave)
membership queriesequivalence queriesexact identificationpolynomial time learningpropositional Horn sentences
Related Items (54)
Learning with queries inside the class of unate \(k\)-quasi-Horn formulas ⋮ Learning an extension of the class of functional dependencies with queries ⋮ Efficient multiple constraint acquisition ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Learning fallible deterministic finite automata ⋮ From equivalence queries to PAC learning: the case of implication theories ⋮ Learning a propagation complete formula ⋮ A representation of antimatroids by Horn rules and its application to educational systems ⋮ An efficient membership-query algorithm for learning DNF with respect to the uniform distribution ⋮ Logical settings for concept-learning ⋮ Learning unions of tree patterns using queries ⋮ Learning orthogonal F-Horn formulas ⋮ Construction and learnability of canonical Horn formulas ⋮ Learning constraints through partial queries ⋮ Negative results on learning multivalued dependencies with queries ⋮ The inverse satisfiability problem ⋮ Learning a subclass of \(k\)-quasi-Horn formulas with membership queries ⋮ Exact learning of multivalued dependency formulas ⋮ Bidual Horn functions and extensions ⋮ Learnability of quantified formulas. ⋮ Copy complexity of Horn formulas with respect to unit read-once resolution ⋮ Approximate inference of functional dependencies from relations ⋮ Computational aspects of monotone dualization: a brief survey ⋮ Learning sets of antecedent-restricted functional and multivalued dependencies with queries ⋮ Classic learning ⋮ Learning definite Horn formulas from closure queries ⋮ Hydras: directed hypergraphs and Horn formulas ⋮ Learning orthogonal F-Horn formulas ⋮ Optimizations in computing the Duquenne-Guigues basis of implications ⋮ Extremal numbers for directed hypergraphs with two edges ⋮ Structure identification in relational data ⋮ On learning multivalued dependencies with queries ⋮ Polynomial certificates for propositional classes ⋮ Unnamed Item ⋮ Learning conditional preference networks ⋮ Pac-learning non-recursive Prolog clauses ⋮ Probably approximately correct learning of Horn envelopes from queries ⋮ Pac-learning non-recursive Prolog clauses ⋮ Translation among CNFs, characteristic models and ordered binary decision diagrams ⋮ Learning large-alphabet and analog circuits with value injection queries ⋮ Unnamed Item ⋮ Rethinking epistemic logic with belief bases ⋮ Learning a circuit by injecting values ⋮ An efficient algorithm for Horn description ⋮ Canonical Horn Representations and Query Learning ⋮ Exact Learning of Multivalued Dependencies ⋮ Combinatorial Problems for Horn Clauses ⋮ Unnamed Item ⋮ The query complexity of finding local minima in the lattice ⋮ Horn approximations of empirical data ⋮ Optimal compression of propositional Horn knowledge bases: Complexity and approximation ⋮ Theory revision with queries: Horn, read-once, and parity formulas ⋮ Approximate computation of exact association rules ⋮ MCP: capturing big data by satisfiability (tool description)
This page was built for publication: Learning conjunctions of Horn clauses
