Learning Conjunctions of Horn Clauses
Machine Learning - Computational learning theory
Randomized algorithms
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Regularity properties for triple systems
Random Structures & Algorithms
On Triple Systems with Independent Neighbourhoods
Combinatorics, Probability and Computing
Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
Combinatorics, Probability and Computing
A continuous–discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
Random Structures & Algorithms
Horn complements: towards horn-to-horn belief revision
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Horn upper bounds and renaming
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
On approximate horn formula minimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
| Hi-index | 0.03 |
Given a family of Horn clauses, what is the minimal number of Horn clauses implying all other clauses in the family? What is the maximal number of Horn clauses from the family without having resolvents of a certain kind? We consider various problems of this type, and give some sharp bounds. We also consider the probability that a random family of a given size implies all other clauses in the family, and we prove the existence of a sharp threshold.