Combinatorial Problems for Horn Clauses (Q3655139)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Combinatorial Problems for Horn Clauses	scientific article

Statements

scholarly article

0 references

Combinatorial Problems for Horn Clauses (English)

0 references

Marina Langlois

0 references

0 references

0 references

Robert H. Sloan

0 references

Graph Theory, Computational Intelligence and Thought

0 references

publication date

7 January 2010

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-02029-2_6

0 references

Learning conjunctions of Horn clauses

0 references

0 references

Horn Upper Bounds and Renaming

0 references

On the logic of theory change: Partial meet contraction and revision functions

0 references

0 references

Short proofs are narrow—resolution made simple

0 references

The intractability of resolution

0 references

Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs

0 references

Regularity properties for triple systems

0 references

On Triple Systems with Independent Neighbourhoods

0 references

Sharp thresholds of graph properties, and the $k$-sat problem

0 references

A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses

0 references

The transitive closure of a random digraph

0 references

0 references

A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-02029-2_6

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3655139

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3655139&oldid=35145758"