Xpath and modal logics of finite DAG‘s

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2796, Issue , 2003, Pages 150-164

  Marx, Maarten ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DIRECTED GRAPHS; FORESTRY; FORMAL LOGIC; ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; FINITE AUTOMATA; GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

COMPLEXITY RESULTS; DIRECTED ACYCLIC GRAPH (DAG); EXPONENTIAL TIME; HYBRID LOGIC; MODAL FORMULAS; ORDERED TREE; QUERY CONTAINMENT; XPATH EXPRESSIONS;

TREES (MATHEMATICS); FORMAL LOGIC;

FINITE ORDERED TREES; MODAL LOGICS; VARIABLE FREE FORMALISMS;

EID: 7044246310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45206-5_13     Document Type: Conference Paper

References (25)

1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the web. Morgan Kaufman, 2000.
2. N. Alechina, S. Demri, and M. de Rijke. A modal perspective on path constraints. Journal of Logic and Computation, 13:1–18, 2003.
3. M. Benedikt, W. Fan, and G. Kuper. Structural properties of XPath fragments, 2003. In Proc. ICDT’03, 2003. To appear.
4. P. Blackburn. Representation, reasoning, and relational structures: a hybrid logic manifesto. Logic Journal of the IGPL, 8(3):339–365, 2000.
5. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.
6. P. Blackburn, B. Gaiffe, and M. Marx. Variable free reasoning on finite trees. In Proceedings of Mathematics of Language (MOL–8), Bloomington, 2003.
7. J. Clark. XML Path Language (XPath). http://www.w3.org/TR/xpath.
8. World-Wide Web Consortium. Xml path language (xpath): Version 2.0. http://www.w3.org/TR/xpath20/.
9. Alin Deutsch and Val Tannen. Containment of regular path expressions under integrity constraints. In Knowledge Representation Meets Databases, 2001.
10. J. Doner. Tree acceptors and some of their applications. J. Comput. Syst. Sci., 4:405–451, 1970.
11. E. Emerson and J. Halpern.”Sometimes and Not Never”; revisited: on branching versus linear time temporal logic. Journal of the ACM (JACM), 33(1):151–178, 1986.
12. M. Fisher and R. Ladner. Propositional dynamic logic of regular programs. J. Comput. Syst. Sci., 18(2):194–211, 1979.
13. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000.
14. M. Kracht. Syntactic codes and grammar refinement. Journal of Logic, Language and Information, 4:41–60, 1995.
15. M. Kracht. Inessential features. In Christian Retore, editor, Logical Aspects of Computational Linguistics, number 1328 in LNAI, pages 43–62. Springer, 1997.
16. M. Marx. XPath and modal logic of finite trees. In Proceedings of M4M 2003, Nancy, 2003.
17. G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In Proc. PODS’02, pages 65–76, 2002.
18. F. Neven and T. Schwentick. XPath containment in the presence of disjunction, DTDs, and variables. In ICDT 2003, 2003.
19. A. Palm. Transforming tree constraints into formal grammars. PhD thesis, Universit ¨at Passau, 1997.
20. A. Palm. Propositional tense logic for trees. In Sixth Meeting on Mathematics of Language. University of Central Florida, Orlando, Florida, 1999.
21. V. Pratt. Models of program logics. In Proceedings of the 20th IEEE symposium on Foundations of Computer Science, pages 115–122, 1979.
22. M. Rabin. Decidability of second order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1–35, 1969.
23. K. Reinhardt. The complexity of translating logic to finite automata. In E. Grädel et al., editor, Automata, Logics, and Infinite Games, volume 2500 of LNCS, pages 231–238. Springer, 2002.
24. B-H. Schlingloff. Expressive completeness of temporal logic of trees. Journal of Applied Non–Classical Logics, 2(2):157–180, 1992.
25. P. Wood. On the equivalence of XML patterns. In Proc. 1st Int. Conf. on Computational Logic, volume 1861 of LNCS, pages 1152–1166, 2000.