XPath with conditional axis relations

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

Volumn 2992, Issue , 2004, Pages 477-494

  Marx, Maarten ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; SEMANTICS;

EXPONENTIAL TIME; EXPRESSIVE POWER; NATURAL SEMANTICS; QUERY EQUIVALENCE; QUERY EVALUATION; QUERY EVALUATION ALGORITHM; STABLE FIXED POINTS; THEORETICAL FOUNDATIONS;

QUERY PROCESSING;

EID: 35048898057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24741-8_28     Document Type: Article

References (42)

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. N. Alechina and N. Immerman. Reachability logic: An efficient fragment of transitive closure logic. Logic Journal of the IGPL, 8(3):325-337, 2000.
4. M. Benedikt, W. Fan, and G. Kuper. Structural properties of XPath fragments. In Proc. ICDT'03, 2003.
5. R. Berwick and A. Weinberg. The Grammatical Basis of Natural Languages. MIT Press, Cambridge, MA, 1984.
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. D. Calvanese, G. De Giacomo, and M. Lenzerini. Representing and reasoning on XML documents: A description logic approach. J. of Logic and Computation, 9(3):295-318,1999.
8. E.M. Clarke and B.-H. Schlingloff. Model checking. Elsevier Science Publishers, to appear.
9. A. Deutsch and V. Tannen. Containment of regularpath 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.M. Clarke and E.A. Emerson. Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. In D. Kozen, editor, Proceedings of the Workshop on Logics of Programs, volume 131 of LNCS, pages 52-71, Springer, 1981.
12. M. Fisher and R. Ladner. Prepositional dynamic logic of regular programs. J. Comput. Syst. Sci., 18(2):194-211, 1979.
13. D.M. Gabbay, I. Hodkinson, and M. Reynolds. Temporal Logic. Oxford Science Publications, 1994. Volume 1: Mathematical Foundations and Computational Aspects.
14. D.M. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proc. 7th ACM Symposium on Principles of 'Programming Languages, pages 163-173,1980.
15. G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proc. of the 28th International Conference on Very Large Data Bases (VLDB 2002), 2002.
16. G. Gottlob, C. Koch, and R. Pichler. The complexity of XPath query evaluation. In PODS 2003, pages 179-190, 2003.
17. G. Gottlob and C. Koch. Monadic queries over tree-structured data. In Proc. LICS, Copenhagen, 2002.
18. D. Harel. Dynamic logic. In D.M. Gabbay and F. Guenther, editors, Handbook of Philosophical Logic, volume 2, pages 497-604. Reidel, Dordrecht, 1984.
19. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000.
20. D. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 67-161. Elsevier, 1990.
21. J.A.W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, 1968.
22. D. Kozen. Results on the propositional mu-calculus. Th. Comp. Science, 27,1983.
23. D. Kozen. Kleene algebra with tests. ACM Transactions on Programming Languages and Systems, 19(3):427-443, May 1997.
24. M. Marx. XCPath, the expressively complete XPath fragment. Manuscript, July 2003.
25. G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In Proc. PODS'02, pages 65-76, 2002.
26. F. Neven and T. Schwentick. XPath containment in the presence of disjunction, DTDs, and variables. In ICDT 2003, 2003.
27. Ch. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
28. V. Pratt. Models of program logics. In Proceedings FoCS, pages 115-122, 1979.
29. M. Rabin. Decidability of second order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-35,1969.
30. 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. 2002.
31. J, Rogers. A descriptive approach to language theoretic complexity. CSLI Press, 1998.
32. W.Thomas. Logical aspects in the study of tree languages. In B. Courcelle, editor, Ninth Colloquium on Trees in Algebra and Programming, pages 31-50. CUP, 1984.
33. M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences, 32:183-221,1986.
34. P. Wadler. Two semantics for XPath. Technical report, Bell Labs, 2000.
35. M. Weyer. Decidability of SIS and S2S. In E. Grädel et al., editor, Automata, Logics, and Infinite Games, volume 2500 of LNCS, pages 207-230. Springer, 2002.
36. P. Wood. On the equivalence of XML patterns. In Proc. 1st Int. Conf. on Computational Logic, volume 1861 of LNCS, pages 1152-1166,2000.
37. W3C. Extensible markup language (XML) 1.0 http://www.w3.org/TR/REC-xml.
38. W3C. XML path language (XPath 1.0). http://ww.w3.org/TR/xpath.html.
39. W3C. XML path language (XPpath 2.0) http://www.w3.org/TR/xpath20/.
40. W3C. XML schema part 1: Structures. http://www.w3.org/TR/xmlschema-l.
41. W3C. Xquery 10: A query language for XML. http://www.w3.Org/TR//xquery/.
42. W3C. XSL transformations language XSLT2.0.http://www.w3.org/TR/xslt20/.