View in EDS PDF Full Text

Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs.

Saved in:
Bibliographic Details
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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 83770479
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Sloan%2C+Robert+H%2E%22">Sloan, Robert H.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Stasi%2C+Despina%22">Stasi, Despina</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Tur´n%2C+György%22">Tur´n, György</searchLink><relatesTo>1,2</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+Mathematics+%26+Theoretical+Computer+Science+%28DMTCS%29%22">Discrete Mathematics & Theoretical Computer Science (DMTCS)</searchLink>. 2012, Vol. 14 Issue 2, p29-36. 7p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Random+measures%22">Random measures</searchLink><br /><searchLink fieldCode="DE" term="%22Horn+clauses%22">Horn clauses</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+variables%22">Mathematical variables</searchLink><br /><searchLink fieldCode="DE" term="%22Probability+theory%22">Probability theory</searchLink><br /><searchLink fieldCode="DE" term="%22Probability+measures%22">Probability measures</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=83770479
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 7
        StartPage: 29
    Subjects:
      – SubjectFull: Random measures
        Type: general
      – SubjectFull: Horn clauses
        Type: general
      – SubjectFull: Mathematical variables
        Type: general
      – SubjectFull: Probability theory
        Type: general
      – SubjectFull: Probability measures
        Type: general
    Titles:
      – TitleFull: Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Sloan, Robert H.
      – PersonEntity:
          Name:
            NameFull: Stasi, Despina
      – PersonEntity:
          Name:
            NameFull: Tur´n, György
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: 2012
              Type: published
              Y: 2012
          Identifiers:
            – Type: issn-print
              Value: 13658050
          Numbering:
            – Type: volume
              Value: 14
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Discrete Mathematics & Theoretical Computer Science (DMTCS)
              Type: main
ResultId 1