Expressiveness and complexity of graph logic (Q870359): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4673420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding validity in a spatial logic for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TQL: a query language for semistructured data based on the ambient logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anytime, anywhere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking mobile ambients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic you can count on / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness and complexity of graph logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating finite automata and star-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on model checking the modal \(\nu\)-calculus / rank
 
Normal rank

Revision as of 14:52, 25 June 2024

scientific article
Language Label Description Also known as
English
Expressiveness and complexity of graph logic
scientific article

    Statements

    Expressiveness and complexity of graph logic (English)
    0 references
    0 references
    0 references
    0 references
    12 March 2007
    0 references
    spatial logics
    0 references
    graphs
    0 references
    complexity
    0 references

    Identifiers

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