Parametrised Complexity of Satisfiability in Temporal Logic (Q5278205)

From MaRDI portal
Revision as of 02:33, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6744589
Language Label Description Also known as
English
Parametrised Complexity of Satisfiability in Temporal Logic
scientific article; zbMATH DE number 6744589

    Statements

    Parametrised Complexity of Satisfiability in Temporal Logic (English)
    0 references
    0 references
    0 references
    0 references
    13 July 2017
    0 references
    parametrised complexity
    0 references
    computation tree logic
    0 references
    linear temporal logic
    0 references
    pathwidth
    0 references
    Post's lattice
    0 references
    temporal depth
    0 references
    temporal logic
    0 references
    treewidth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references