THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆ (Q3646173)

From MaRDI portal
Revision as of 11:53, 17 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
scientific article

    Statements

    THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆ (English)
    0 references
    19 November 2009
    0 references
    computational complexity
    0 references
    temporal logic
    0 references
    satisfiability
    0 references
    Post's lattice
    0 references

    Identifiers