 |
Discrete Mathematics & Theoretical Computer Science |
Robert H. Sloan ; Despina Stasi ; György Turán - Random Horn formulas and propagation connectivity for directed hypergraphs
dmtcs:578 - Discrete Mathematics & Theoretical Computer Science, August 16, 2012, Vol. 14 no. 2 - https://doi.org/10.46298/dmtcs.578Random Horn formulas and propagation connectivity for directed hypergraphsArticle
- 1 Departement of Computer Science [UIC]
- 2 Departement of Computer Science [UIC]
- 3 Hungarian Academy of Sciences
- 4 MTA-SZTE Research Group on Artificial Intelligence
Combinatorics
[en]
We consider the property that in a random definite Horn formula of size-3 clauses over n variables, where every such clause is included with probability p, there is a pair of variables for which forward chaining produces all other variables. We show that with high probability the property does not hold for p <= 1/(11n ln n), and does hold for p >= (5 1n ln n)/(n ln n).
Source: HAL:hal-00990587v1
Volume: Vol. 14 no. 2
Section: Combinatorics
Published on: August 16, 2012
Imported on: October 17, 2010
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Funding:
- Source : OpenAIRE Graph
- Theoretical Foundations of Evolving Knowledge Bases; Funder: National Science Foundation; Code: 0916708
Consultation statistics
This page has been seen 615 times.
This article's PDF has been downloaded 609 times.