A Modal Perspective on Path Constraints

Journal of Logic and Computation

Volumn 13, Issue 6, 2003, Pages 939-956

  Alechina, Natasha ^a   Demri, Stéphane ^b   De Rijke, Maarten ^c  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b CNRS   (France)

^c UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Automata theory; Modal logic; Path constraints; Semistructured data

Indexed keywords

AUTOMATA THEORY; DATA REDUCTION; FORMAL LOGIC; SEMANTICS; WORLD WIDE WEB;

PATH CONSTRAINTS; SEMISTRUCTURED DATA;

DATABASE SYSTEMS;

EID: 0346707453     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/13.6.939     Document Type: Review

References (45)

1. S. Abiteboul. P. Buneman, and D. Suciu. Data on the Web. Morgan Kaufmann, 2000.
2. S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. Wiener. The LOREL query language for semi structured data. Journal on Digital Libraries, 1, 68-88, 1997.
3. S. Abiteboul and V. Vianu. Regular path queries with constraints. Journal of Computer and System Sciences, 58, 428-452, 1999.
4. N. Alechina, S. Demri, and M. de Rijke. Path constraints from a modal logic point of view (extended abstract). In 8th International Workshop on Knowledge Representation meets Databases (KRDB-2001), Roma. September 2001. Available at http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS
5. L. de Alfaro. Model checking the world wide web. In Computer Aided Verification, G. Berry, H. Comon, and A. Finkel, eds, volume 2102 of Lecture Notes in Computer Science, pp. 337-349. Springer-Verlag, 2001.
6. H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27, 217-274, 1998.
7. C. Areces, P. Blackburn, and M. Marx. A road-map on complexity for hybrid logics. In Computer Science Logic, J. Flum and M. Rodríguez-Artalejo, eds, volume 1683 of Lecture Notes in Computer Science, pp. 307-321. Springer Verlag, 1999.
8. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, 2nd edition. Springer, Berlin, 1988.
9. M. Ben-Ari, J. Halpern, and A. Pnueli. Deterministic propositional dynamic logic: finite models, complexity and completeness. Journal of Computer and System Sciences, 25, 402-417, 1982.
10. P. Blackburn and J. Seligman. Hybrid languages. Journal of Logic, Language and Information, 4, 251-272, 1995.
11. P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu. A query language and optimization techniques for unstructured data. In ACM SIGMOD International Conference on the Management of Data, pp. 505-516, 1996.
12. P. Buneman, W. Fan, and S. Weinstein. Path constraints on deterministic graphs. Technical Report MS-CIS-98-33, LINCS, CIS, UPenn, 1998.
13. P. Buneman, W. Fan, and S. Weinstein. Path constraints on semistructured and structured data. In Proceedings PODS'98, pp. 129-138. Seattle, Washington, 1998.
14. D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. View-based query answering and query containment over semistructured data. In The 8th International Workshop on Database Programming Languages (DBPL'01), pp. 40-61, 2001.
15. L. Capra, E. Ellmer, W. Emmerich, A. Finkelstein, Ch. Nentwich, D. Smolko, and A. Zisman. xlinkit: the consistency checking and link generation engine developed at the University College London. Available at http://www.xlinkit.com.
16. L. Cardelli, Ph. Gardner, and G. Ghelli. A spatial logic for querying graphs. In ICALP'02, Malaga, Spain, volume 2380 of Lecture Notes in Computer Science, pp. 597-610. Springer, Berlin, 2002.
17. C. Chen and I. Lin. The complexity of propositional modal theories and the complexity of consistency of propositional modal theories. In LFCS-3, St. Petersburg, A. Nerode and Yu. V. Matiyasevich. eds, volume 813 of Lecture Notes in Computer Science, pp. 69-80. Springer Verlag, 1994.
18. R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mucalculus. In Computer-Aided Verification (CAV'91), Aalborg, Denmark, K. Larsen and A. Skou, eds, volume 575 of Lecture Notes in Computer Science, pp. 48-58. Springer Verlag, 1991.
19. B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In Handbook of Graph Grammars and Computing by Graph Transformations - Volume 1: Foundations, G. Rozenberg, ed., pp. 313-400. World Scientific, New-Jersey, London, 1997.
20. G. De Giacomo. Decidability of Class-Based Knowledge Representation Formalisms, PhD thesis, Universitá degli Studi di Roma 'La Sapienza', 1995.
21. F.M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Reasoning in description logics. In Principles of Knowledge Representation, Studies in Logic, Language and Information, G. Brewka, ed., pp. 191-236. CSLI Publications, 1996.
22. N.J. Fisher and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18, 194-211, 1979.
23. G. Gargov and S. Passy. Determinism and looping in combinatory PDL. Theoretical Computer Science, 61, 259-277, 1988.
24. V. Goranko. Hierarchies of modal and temporal logics with references pointers. Journal of Logic, Language and Information, 5, 1-24, 1996.
25. G. Gottlob and C. Koch. Monadic queries over tree-structured data. In LICS'02, pp. 189-202. IEEE Computer Society, 2002.
26. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-completeness theory. Oxford University Press, New York, Oxford, 1995.
27. J. Halpern. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artificial Intelligence, 75, 361-372, 1995.
28. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic, The MIT Press, 2000.
29. E. R. Harold and W. S. Means. XML in a Nutshell. O'Reilly, 2001.
30. P. Hayes. RDF model theory. W3C Working Draft 25 September 2001. Available at http://www.w3.org/TR/rdf-mt/.
31. E. Hemaspaandra. The price of universality. Notre Dame Journal of Formal Logic, 37, 173-203, 1996.
32. E. Hemaspaandra. The complexity of poor man's logic. Journal of Logic and Computation, 11, 609-622, 2001.
33. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery, 32, 137-161, 1985.
34. H. Hunt, D. Rosenkrantz, and Th. Szymanski. On the equivalence, containment, and covering problems for the regular and context-free languages. Journal of Computer and System Sciences, 12, 222-268, 1976.
35. A. Mendelzon, G. Mihaila, and T. Milo. Querying the world wide web. International Journal on Digital Libraries, 1, 54-67, 1997.
36. A. Mendelzon and P. Wood. Finding regular simple paths in graph databases. SIAM Journal on Computing, 24, 1235-1258, 1995.
37. G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In 21st ACM Symposium on Principles of Databases Systems (PODS), Madison, Wisconsin, pp. 65-76, 2002.
38. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
39. R. Parikh. Propositional logics of programs: systems, models and complexity. In 7th Annual ACM Symposium on Principles of Programming Languages, pp. 186-192, 1980.
40. V. P. Pratt. Models of program logics. In Proceedings of the 20th IEEE Symposium Foundations of Computer Science, pp. 115-222, 1979.
41. N. Rescher and A. Urquhart. Temporal Logic. Springer-Verlag, 1971.
42. W. C. Rounds. Feature logics. In Handbook of Logic and Language, J. van Benthem and A. ter Meulen, eds, pp. 475-534. Elsevier Science, 1997.
43. U. Sattler and M. Vardi. The hybrid mu-calculus. In Proceedings of IJCAR 2001, A. Leitsch, R. Goré, and T. Nipkow, eds, volume 2083 of Lecture Notes in Artificial Intelligence, pp. 76-91. Springer-Verlag, 2001.
44. M. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32, 183-221, 1986.
45. W3C. XML Path Language (XPath) 1.0. Available at http://www.w3.org/TR/xpath.