Complexity and Succinctness Issues for Linear-Time Hybrid Logics (Q3532457): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hybrid logics: characterization, interpolation and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and Succinctness Issues for Linear-Time Hybrid Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics in simple cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking hybrid logics (with an application to semistructured data) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of modal and temporal logics with reference pointers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating finite automata on \(\omega\)-words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-Variable Fragments of Hybrid Logics / rank
 
Normal rank

Latest revision as of 19:10, 28 June 2024

scientific article
Language Label Description Also known as
English
Complexity and Succinctness Issues for Linear-Time Hybrid Logics
scientific article

    Statements

    Identifiers

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