Combinatorial Problems for Horn Clauses

DOI10.1007/978-3-642-02029-2_6MaRDI QIDQ3655139zbMATH OpenOpenAlexFDO

Authors Marina Langlois, Dhruv Mubayi, Gy. Turán, R. 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)

Recommendations

• A combinatorial algorithm for Horn programs
• A combinatorial algorithm for Horn programs
• On word problems in Horn theories
• scientific article; zbMATH DE number 4089521
• scientific article; zbMATH DE number 4064978
• scientific article; zbMATH DE number 19146
• Automated Deduction – CADE-20
• COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS
• On the Boolean connectivity problem for Horn relations

Cites work

• A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas
• A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses
• Horn Upper Bounds and Renaming
• scientific article; zbMATH DE number 1470716 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 3375520 (Why is no real title available?)
• Learning conjunctions of Horn clauses
• On the logic of theory change: Partial meet contraction and revision functions
• On Triple Systems with Independent Neighbourhoods
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Regularity properties for triple systems
• Sharp thresholds of graph properties, and the k-sat problem
• Short proofs are narrow—resolution made simple
• The intractability of resolution
• The transitive closure of a random digraph

Cited in

(7)

• Extremal numbers for directed hypergraphs with two edges
• Problem corner: Non-Horn problems
• scientific article; zbMATH DE number 1670600 (Why is no real title available?)
• On the Boolean Connectivity Problem for Horn Relations
• scientific article; zbMATH DE number 19146 (Why is no real title available?)
• Random Horn formulas and propagation connectivity for directed hypergraphs
• Coloring directed hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655139)