Expressiveness and complexity of graph logic

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.

[1]  Jean-Marc Talbot,et al.  Expressiveness of spatial logic for trees , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[2]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[3]  Supratik Mukhopadhyay,et al.  Model checking mobile ambients , 2003, Theor. Comput. Sci..

[4]  Sheng Yu,et al.  Alternating finite automata and star-free languages , 2000, Theor. Comput. Sci..

[5]  Luca Cardelli,et al.  TQL: A Query Language for Semistructured Data Based on the Ambient Logic , 2003 .

[6]  Y. Gurevich.  On Finite Model Theory , 1990 .

[7]  Alexander Okhotin,et al.  Conjunctive Grammars , 2001, J. Autom. Lang. Comb..

[8]  Peter W. O'Hearn,et al.  Local Reasoning about Programs that Alter Data Structures , 2001, CSL.

[9]  Giorgio Ghelli,et al.  Decidability of Freshness, Undecidability of Revelation , 2004, FoSSaCS.

[10]  Giorgio Ghelli,et al.  Decidability of freshness, undecidability of revelation (extended abstract) , 2004 .

[11]  Robert McNaughton,et al.  Counter-Free Automata (M.I.T. research monograph no. 65) , 1971 .

[12]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[13]  Silvano Dal-Zilio,et al.  A logic you can count on , 2004, POPL.

[14]  Luca Cardelli,et al.  Anytime, anywhere: modal logics for mobile ambients , 2000, POPL '00.

[15]  Thomas Schwentick,et al.  Numerical document queries , 2003, PODS.

[16]  Jean-Marc Talbot,et al.  On Complexity of Model-Checking for the TQL Logic , 2004, IFIP TCS.

[17]  Luca Cardelli,et al.  Deciding validity in a spatial logic for trees , 2003, TLDI '03.

[18]  Peter W. O'Hearn,et al.  Computability and Complexity Results for a Spatial Assertion Language for Data Structures , 2001, APLAS.

[19]  Luca Cardelli,et al.  A Spatial Logic for Querying Graphs , 2002, ICALP.

[20]  Glynn Winskel,et al.  A Note on Model Checking the Modal nu-Calculus , 1991, Theor. Comput. Sci..

[21]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[22]  Paolo Manghi,et al.  Types for Correctness of Queries over Semistructured Data , 2002, WebDB.

[23]  Paolo Manghi,et al.  The Query Language TQL , 2002, WebDB.

[24]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[25]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[26]  Étienne Lozes.  Adjuncts elimination in the static ambient logic , 2003, EXPRESS.

[27]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.