Separating Graph Logic from MSO

Authors:
Timos Antonopoulos;Anuj Dawar
Affiliations:
Computer Laboratory, University of Cambridge, Cambridge, UK CB3 0FD;Computer Laboratory, University of Cambridge, Cambridge, UK CB3 0FD
Venue:
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Year:
2009

Citing 9
Cited 1

A logical approach to asymptotic combinatorics II: monadic second-order properties

Journal of Combinatorial Theory Series A
The expression of graph properties and graph transformations in monadic second-order logic

Handbook of graph grammars and computing by graph transformation
Back and forth between guarded and modal logics

ACM Transactions on Computational Logic (TOCL)
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Spatial Logic for Querying Graphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Expressiveness and complexity of graph logic

Information and Computation
On the Almighty Wand

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
On the expressive power of graph logic

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Adjunct elimination through games in static ambient logic

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

On the almighty wand

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of Monadic Second Order Logic (MSO), with quantification over sets of edges. We show that the containment is proper by exhibiting a property that is not GL definable but is definable in MSO, even in the absence of quantification over labels. Moreover, this holds when the graphs are restricted to be forests and thus strengthens in several ways a result of Marcinkowski. As a consequence we also obtain that Separation Logic, with a separating conjunction but without the magic wand, is strictly weaker than MSO over memory heaps, settling an open question of Brochenin et al.