• DocumentCode
    2597282
  • Title

    A small universal model for system executions

  • Author

    Gischer, Jay L.

  • Author_Institution
    Dept. of Comput. Sci., Coll. of William & Mary, Williamsburg, VA, USA
  • fYear
    1989
  • fDate
    5-8 Jun 1989
  • Firstpage
    146
  • Lastpage
    153
  • Abstract
    The author shows that every consistent set of atomic relations has a unified model of size roughly O(n2). This model can be used to give a simplified proof of completeness of some axioms. He gives several complexity results for deciding the theory of several classes of axiom sets, for both partial models and global-time models, showing many such variations to have the same complexity as transitive closure or matrix multiplication. The author shows that deciding disjunctive axioms is NP-complete for both the global-time and the standard model
  • Keywords
    computational complexity; decidability; formal languages; formal logic; NP-complete; atomic relations; axiom sets; completeness; complexity results; consistent set; decidability; disjunctive axioms; global-time models; matrix multiplication; partial models; simplified proof; system executions; transitive closure; unified model; universal model; Computer science; Educational institutions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 1989. LICS '89, Proceedings., Fourth Annual Symposium on
  • Conference_Location
    Pacific Grove, CA
  • Print_ISBN
    0-8186-1954-6
  • Type

    conf

  • DOI
    10.1109/LICS.1989.39169
  • Filename
    39169
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2597282