Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Random Horn formulas ...
Article

Random Horn formulas and propagation connectivity for directed hypergraphs

Robert H. Sloan (1), Despina Stasi (1), György Turán (1) (2) (3)
(1) Departement of Computer Science [UIC]
(2) Hungarian Academy of Sciences
(3) MTA-SZTE Research Group on Artificial Intelligence
Download article
Open on HAL
Imported on
October 16, 2010
Published on
August 15, 2012
Last modified on
March 31, 2025
Volume 14
vol. 14:2
Combinatorics
DOI
10.46298/dmtcs.578
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
0916708
Theoretical Foundations of Evolving Knowledge Bases
Indicators
878
Views
788
Downloads

Random Horn formulas and propagation connectivity for directed hypergraphs

Robert H. Sloan (1), Despina Stasi (1), György Turán (1) (2) (3)
(1) Departement of Computer Science [UIC]
(2) Hungarian Academy of Sciences
(3) MTA-SZTE Research Group on Artificial Intelligence
Abstract
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).
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Preview
Loading PDF preview...