Combinatorial Problems for Horn Clauses

DOI10.1007/978-3-642-02029-2_6zbMath1194.68213OpenAlexW1538993357MaRDI QIDQ3655139

György Turán, Dhruv Mubayi, Marina Langlois, Robert H. Sloan

Publication date: 7 January 2010

Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02029-2_6

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (2)

Coloring directed hypergraphs ⋮ Extremal numbers for directed hypergraphs with two edges

Cites Work

• The intractability of resolution
• Learning conjunctions of Horn clauses
• The transitive closure of a random digraph
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Horn Upper Bounds and Renaming
• On the logic of theory change: Partial meet contraction and revision functions
• Sharp thresholds of graph properties, and the $k$-sat problem
• Short proofs are narrow—resolution made simple
• Regularity properties for triple systems
• A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas
• On Triple Systems with Independent Neighbourhoods
• A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial Problems for Horn Clauses