Model checking hybrid logics (with an application to semistructured data)

Journal of Applied Logic

Volumn 4, Issue 3, 2006, Pages 279-304

  Franceschet, Massimo ^a,b   de Rijke, Maarten ^b  

^a UNIVERSITY OF CHIETI   (Italy)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Hybrid logics; Modal logics; Model checking; Semistructured data

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING;

HYBRID LOGICS; MODAL LOGICS; MODEL CHECKING; SEMISTRUCTURED DATA;

FORMAL LOGIC;

EID: 33746791937     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2005.06.010     Document Type: Article

References (38)

1. Abiteboul S., Buneman P., and Suciu D. Data on the Web (2000), Morgan Kaufmann, Los Altos, CA
2. Abiteboul S., Hull R., and Vianu V. Foundations of Databases (1995), Addison-Wesley, Reading, MA
3. Abiteboul S., Quass D., McHugh J., Widom J., Wiener J., and Widom J. The lorel query language for semistructured data. Internat. J. Digital Libraries 1 1 (1997) 68-88
4. Abiteboul S., and Vianu V. Regular path queries with constraints. J. Comput. System Sci. 58 3 (1999) 428-452
5. L. Afanasiev, M. Franceschet, M. Marx, M. de Rijke, CTL model checking for processing simple XPath queries, in: Proceedings TIME 2004, 2004, pp. 117-124
6. Alechina N., and de Rijke M. Describing and querying semistructured data: Some expressiveness results. In: Embury S.M., Fiddian N.J., Gray W.A., and Jones A.C. (Eds). Advances in Databases. Lecture Notes in Comput. Sci. (1998), Springer, Berlin
7. Alechina N., Demri S., and de Rijke M. A modal perspective on path constraints. J. Logic Comput. 13 6 (2003) 939-956
8. De Alfaro L. Model checking the World Wide Web. Proceedings CAV 2001. Lecture Notes in Comput. Sci. vol. 2102 (2001), Springer, Berlin 337-349
9. Areces C., Blackburn P., and Marx M. A road-map on complexity for hybrid logics. In: Flum J., and Rodrigues-Artalejo M. (Eds). Computer Science Logic. Lecture Notes in Comput. Sci. vol. 1683 (1999), Springer, Berlin 307-321
10. Areces C., Blackburn P., and Marx M. The computational complexity of hybrid temporal logics. Logic J. IGPL 8 5 (2000) 653-679
11. Areces C., Blackburn P., and Marx M. Hybrid logics: Characterization, interpolation, and complexity. J. Symbolic Logic 66 3 (2001) 977-1010
12. Areces C., and Heguiabehere J. HyLoRes 1.0: Direct resolution for hybrid logics. In: Voronkov A. (Ed). Automated Deduction-CADE-18. Lecture Notes in Comput. Sci. vol. 2392 (2002), Springer, Berlin 156-160
13. Blackburn P., de Rijke M., and Venema Y. Modal Logic (2001), Cambridge University Press, Cambridge
14. Blackburn P., and Seligman J. Hybrid languages. J. Logic Language Inform. 4 (1995) 251-272
15. Blackburn P., and Seligman J. What are hybrid languages?. In: Kracht M., de Rijke M., Wansing H., and Zakharyaschev M. (Eds). Advances in Modal Logic, vol. 1 (1998), CSLI Publications 41-62
16. Bull R. An approach to tense logic. Theoria 36 (1970) 282-300
17. P. Buneman, W. Fan, S. Weinstein, Path constraints on semistructured and structured data, in: Proceedings PODS, 1998, pp. 129-138
18. Calvanese D., De Giacomo G., and Lenzerini M. Representing and reasoning on XML documents: A description logic approach. J. Logic Comput. 9 3 (1999) 295-318
19. Clarke E.M., Grumberg O., and Peled D.A. Model Checking (1999), MIT Press, Cambridge, MA
20. Clarke E.M., and Schlingloff H. Model checking. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning, vol. II (2001), Elsevier Science, Amsterdam 1635-1790 (Chapter 24)
21. Cleaveland R., and Steffen B.U. A linear-time model checking algorithm for the alternation-free modal mu-calculus. Formal Methods in System Design 2 (1993) 121-147
22. Emerson E.A. Temporal and modal logic. In: Van Leeuwen J. (Ed). Handbook of Theoretical Computer Science, vol. B (1990), Elsevier Science, Amsterdam 995-1072
23. Fan W., and Siméon J. Integrity constraints for XML. J. Comput. System Sci. 66 1 (2003) 254-291
24. Franceschet M., de Rijke M., and Schlingloff B.H. Hybrid logics on linear structures: expressivity and complexity. Proceedings TIME 2003 (2003), IEEE Computer Society Press 166-173
25. Goranko V. Hierarchies of modal and temporal logics with reference pointers. J. Logic Language Inform. 5 1 (1996) 1-24
26. Gottlob G., and Koch C. Monadic queries over tree-structured data. Logic in Computer Science, Los Alamitos, CA (2002), IEEE Computer Society 189-202
27. Halpern J.Y., Harper R., Immerman N., Kolaitis P.G., Vardi M., and Vianu V. On the unusual effectiveness of logic in computer science. Bull. Symbolic Logic 7 2 (2001) 213-236
28. Harel D., Tiuryn J., and Kozen D. Dynamic Logic (2000), MIT Press, Cambridge, MA
29. HyLo: The hybrid logic home page. http://hylo.loria.fr
30. M. Marx, Conditional XPath, the first order complete XPath dialect, in: Proceedings PODS, 2004, pp. 13-22
31. McHugh J., Abiteboul S., Goldman R., Quass D., and Widom J. Lore: A database management system for semistructured data. SIGMOD Record (ACM Special Interest Group on Management of Data) 26 3 (1997) 54-66
32. G. Miklau, D. Suciu, Containment and equivalence for an XPath fragment, in: Proceedings PODS, 2002, pp. 65-76
33. Papadimitriou C. Computational Complexity (1994), Addison-Wesley, Reading, MA
34. Passy S., and Tinchev T. An essay in combinatory dynamic logic. Inform. and Comput. 93 2 (1991) 263-332
35. Prior A. Past, Present and Future (1967), Clarendon, Oxford
36. E. Quintarelli, Model-checking based data retrieval: An application to semistructured and temporal data, PhD thesis, Dipartimento di Elettronica e Informazione, Politecnico di Milano, 2000
37. B. ten Cate, Model theory for extended modal languages, PhD thesis, University of Amsterdam, ILLC Dissertation Series DS-2005-01, 2005
38. World Wide Web Consortium, Extensible markup language (XML), available at. http://www.w3.org/XML 1998