Sciweavers

BIRTHDAY
2009
Springer

Combinatorial Problems for Horn Clauses

13 years 10 months ago
Combinatorial Problems for Horn Clauses
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.
Marina Langlois, Dhruv Mubayi, Robert H. Sloan, Gy
Added 19 May 2010
Updated 19 May 2010
Type Conference
Year 2009
Where BIRTHDAY
Authors Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán
Comments (0)