Expressiveness and complexity of graph logic
From MaRDI portal
Publication:870359
DOI10.1016/j.ic.2006.10.006zbMath1114.03028OpenAlexW2029632316WikidataQ58215601 ScholiaQ58215601MaRDI QIDQ870359
Anuj Dawar, Philippa Gardner, Giorgio Ghelli
Publication date: 12 March 2007
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2006.10.006
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic in computer science (03B70)
Related Items (12)
Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction ⋮ On Composing Finite Forests with Modal Logics ⋮ Expressiveness and complexity of graph logic ⋮ Separation logic with one quantified variable ⋮ Separation logics and modalities: a survey ⋮ Two-Variable Separation Logic and Its Inner Circle ⋮ On the almighty wand ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ On the Almighty Wand ⋮ A Spatial Equational Logic for the Applied π-Calculus ⋮ Separating Graph Logic from MSO ⋮ On Temporal and Separation Logics
Cites Work
- Expressiveness and complexity of graph logic
- The directed subgraph homeomorphism problem
- A note on model checking the modal \(\nu\)-calculus
- The polynomial-time hierarchy
- Alternating finite automata and star-free languages
- Model checking mobile ambients
- Weak Second‐Order Arithmetic and Finite Automata
- Deciding validity in a spatial logic for trees
- A logic you can count on
- TQL: a query language for semistructured data based on the ambient logic
- Anytime, anywhere
- Foundations of Software Science and Computation Structures
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Expressiveness and complexity of graph logic
