Expressiveness and complexity of graph logic

Information and Computation

Volumn 205, Issue 3, 2007, Pages 263-310

  Dawar, Anuj ^a   Gardner, Philippa ^b   Ghelli, Giorgio ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

Complexity; Graphs; Spatial logics

Indexed keywords

COMPUTATIONAL METHODS; INFORMATION SYSTEMS;

BASIC COMPOSITION; COMBINED COMPLEXITY; COMPLEXITY; EXPRESSIVE POWER; GRAPHS; MONADIC SECOND-ORDER LOGIC; PSPACE-COMPLETE PROBLEMS; SPATIAL LOGIC;

COMPUTER CIRCUITS;

EID: 84855199038     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.10.006     Document Type: Article

References (27)

1. I. Boneva, J.-M. Talbot, On complexity of model-checking for the TQL logic, in: 3rd IFIP International Conference on Theoretical Computer Science, August 2004.
2. I. Boneva, J.-M. Talbot, S. Tison, Expressiveness of a spatial logic for trees, in: LICS 2005, 2005, pp. 280-289.
3. J. R. Büchi, Weak second order arithmetic and finite automata, Zeitschrift f. Mathematische Logik und Grundlagen d. Mathematik 6(1960) 66-92.
4. C. Calcagno, H. Yang, P. W. O'Hearn, Computability and complexity results for a spatial assertion language for data structures, in: FSTTCS: 21st Conference, volume 2245 of Springer LNCS, 2001, pp. 108-119. (Pubitemid 33371156)
5. Cristiano Calcagno, Luca Cardelli, Andrew D. Gordon, Deciding validity in a spatial logic for trees, ACM SIGPLAN Notices 38(3) (2003) 62-73.
6. L. Cardelli, P. Gardner, G. Ghelli, A spatial logic for querying graphs, in: ICALP: Automata, Languages, and Programming, 29th International Colloquium, vol. 2380, Springer LNCS, 2002, pp. 597-610.
7. L. Cardelli, G. Ghelli, TQL: a query language for semistructured data based on the ambient logic, Mathematical Structures in Computer Science, 2003. To appear..
8. L. Cardelli, Andrew D. Gordon, Anytime, anywhere: modal logics formobile ambients, in: POPL, 2000, pp. 365-377..
9. W. Charatonik, S. Dal Zilio, A. D. Gordon, S. Mukhopadhyay, J-M. Talbot, Model checking mobile ambients, Theoretical Computer Science 308(2003) 277-331.
10. G. Conforti, G. Ghelli, Decidability of freshness, undecidability of revelation (extended abstract), in: FoSSaCS: Foundations of Software Science and Computation Structures, 7th Conference, March-April 2004, pp. 105-120.
11. G. Conforti, G. Ghelli, A. Albano, D. Colazzo, P. Manghi, C. Sartiani, The query language TQL, in: International Workshop on the Web and Databases (WebDB), Madison, Wisconsin, USA, 2002, pp. 19-24.
12. B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Graph Transformations, chapter 5, World Scientific, 1997, pp. 313-400.
13. S. Dal Zilio, D. Lugiez, C. Meyssonnier, A logic you can count on, in: POPL: 31st ACM Symposium on Principles of Programming Languages, 2004, pp. 135-146.
14. A. Dawar, P. Gardner, G. Ghelli, Games for the ambient logic, forthcoming.
15. A. Dawar, P. Gardner, G. Ghelli, Expressiveness and complexity of graph logic, Technical Report 2004/3, Imperial College, London, April 2004.
16. H-D. Ebbinghaus, J. Flum, Finite Model Theory, 2nd ed., Springer, New York, 1999.
17. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R. M. Karp (Ed.), Complexity of Computation, SIAM-AMS Proceedings, vol. 7, 1974, pp. 43-73.
18. S. Fortune, J. Hopcroft, J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science 10(2) (1980) 111-121.
19. E. Lozes, Adjuncts elimination in the static ambient logic, in: Proceedings of Express'03, Marseille, 2003.
20. R. McNaughton, S. Papert, Counter-Free Automata, MIT Press, Cambridge, MA, 1971.
21. Peter W. O'Hearn, John C. Reynolds, Hongseok Yang, Local reasoning about programs that alter data structures, in: Proceedings of the 15th International Workshop on Computer Science Logic, Springer-Verlag, 2001, pp. 1-19. (Pubitemid 33332625)
22. A. Okhotin, Conjunctive grammars, Journal of Automata, Languages and Combinatorics 6(4) (2001) 519-535.
23. C. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1995.
24. Kai Salomaa, Sheng Yu, Alternating finite automata and star-free languages, Theoretical Computer Science 234 (1-2) (2000) 167-176.
25. H. Seidl, T. Schwentick, A. Muscholl, Numerical document queries, in: 22nd Symp. on Principles of Database Systems, 2003, pp. 155-166.
26. L. Stockmeyer, The polynomial-time hierarchy, Theoretical Computer Science 3(1976) 1-22.
27. G. Winskel, A note on model checking the modal nu-calculus, Theoretical Computer Science 83(1) (1991) 157-167. (Pubitemid 21677683)