Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs.
Saved in:
| Title: | Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs. |
|---|---|
| Authors: | Sloan, Robert H.1, Stasi, Despina1, Tur´n, György1,2 |
| Source: | Discrete Mathematics & Theoretical Computer Science (DMTCS). 2012, Vol. 14 Issue 2, p29-36. 7p. |
| Subjects: | Random measures, Horn clauses, Mathematical variables, Probability theory, Probability measures |
| 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 ln ln n)=(n ln n). [ABSTRACT FROM AUTHOR] |
| Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
