The Complexity of Satisfiability for Fragments of CTL and CTL⋆ (Q4982095)

From MaRDI portal
Revision as of 01:55, 22 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57998331, #quickstatements; #temporary_batch_1711055989931)
scientific article; zbMATH DE number 6418604
Language Label Description Also known as
English
The Complexity of Satisfiability for Fragments of CTL and CTL⋆
scientific article; zbMATH DE number 6418604

    Statements

    The Complexity of Satisfiability for Fragments of CTL and CTL⋆ (English)
    0 references
    23 March 2015
    0 references
    temporal logic
    0 references
    satisfiability
    0 references
    Post lattice
    0 references

    Identifiers