A note on model checking the model &ngr;-calculus
Selected papers of the 16th international colloquium on Automata, languages, and programming
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Alternating finite automata and star-free languages
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Deciding validity in a spatial logic for trees
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking mobile ambients
Theoretical Computer Science
TQL: a query language for semistructured data based on the ambient logic
Mathematical Structures in Computer Science
Expressiveness of a Spatial Logic for Trees
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
A Spatial Equational Logic for the Applied Π-Calculus
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Separating Graph Logic from MSO
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
Abstraction of object graphs in program verification
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Counterpart semantics for a second-order µ-calculus
ICGT'10 Proceedings of the 5th international conference on Graph transformations
On the expressive power of graph logic
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Information and Computation
Deciding safety properties in infinite-state pi-calculus via behavioural types
Information and Computation
Graph Logics with Rational Relations and the Generalized Intersection Problem
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Counterpart Semantics for a Second-Order μ-Calculus
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Satisfiability of a spatial logic with tree variables
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Exploiting over- and under-approximations for infinite-state counterpart models
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Specification and verification of modal properties for structured systems
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Hi-index | 0.00 |
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provides the simplest setting in which to explore such results for spatial logics. We study several forms of the logic: the logic with and without recursion, and with either an exponential or a linear version of the basic composition operator. We study the combined complexity and the expressive power of the four combinations. We prove that, without recursion, the linear and exponential versions of the logic correspond to significant fragments of first-order (FO) and monadic second-order (MSO) Logics; the two versions are actually equivalent to FO and MSO on graphs representing strings. However, when the two versions are enriched with @m-style recursion, their expressive power is sharply increased.Both are able to express PSPACE-complete problems, although their combined complexity and data complexity still belong to PSPACE.