Pages that link to "Item:Q870359"
From MaRDI portal
The following pages link to Expressiveness and complexity of graph logic (Q870359):
Displaying 24 items.
- On the almighty wand (Q418137) (← links)
- Deciding safety properties in infinite-state pi-calculus via behavioural types (Q418155) (← links)
- Expressiveness and complexity of graph logic (Q870359) (← links)
- On expressiveness of the chain graph interpretations (Q895519) (← links)
- Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree (Q910223) (← links)
- Semantics for existential graphs (Q1272833) (← links)
- Separation logic with one quantified variable (Q2411038) (← links)
- The expressibility of fragments of hybrid graph logic on finite digraphs (Q2446549) (← links)
- Graph logics with rational relations (Q2846573) (← links)
- L-recursion and a new logic for logarithmic space (Q2915689) (← links)
- Two-Variable Separation Logic and Its Inner Circle (Q2957697) (← links)
- On the Almighty Wand (Q3540188) (← links)
- A Spatial Equational Logic for the Applied π-Calculus (Q3541032) (← links)
- On the Expressive Power of Graph Logic (Q3613359) (← links)
- Separating Graph Logic from MSO (Q3617721) (← links)
- A term-graph clausal logic: completeness and incompleteness results ★ (Q3643364) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
- On Temporal and Separation Logics (Q5079764) (← links)
- (Q5272991) (← links)
- Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction (Q5277913) (← links)
- On Composing Finite Forests with Modal Logics (Q5886519) (← links)
- Specification and verification of a linear-time temporal logic for graph transformation (Q6535505) (← links)
- A presheaf semantics for quantified temporal logics (Q6562516) (← links)
