{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:45Z","timestamp":1761611265856},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212003"},{"type":"electronic","value":"9783540247418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24741-8_28","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T14:56:54Z","timestamp":1280761014000},"page":"477-494","source":"Crossref","is-referenced-by-count":44,"title":["XPath with Conditional Axis Relations"],"prefix":"10.1007","author":[{"given":"Maarten","family":"Marx","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","volume-title":"Data on the web","author":"S. Abiteboul","year":"2000","unstructured":"Abiteboul, S., Buneman, P., Suciu, D.: Data on the web. Morgan Kaufman, San Francisco (2000)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/logcom\/13.6.939","volume":"13","author":"N. Alechina","year":"2003","unstructured":"Alechina, N., Demri, S., de Rijke, M.: A modal perspective on path constraints. Journal of Logic and Computation\u00a013, 1\u201318 (2003)","journal-title":"Journal of Logic and Computation"},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1093\/jigpal\/8.3.325","volume":"8","author":"N. Alechina","year":"2000","unstructured":"Alechina, N., Immerman, N.: Reachability logic: An efficient fragment of transitive closure logic. Logic Journal of the IGPL\u00a08(3), 325\u2013337 (2000)","journal-title":"Logic Journal of the IGPL"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-36285-1_6","volume-title":"Database Theory - ICDT 2003","author":"M. Benedikt","year":"2002","unstructured":"Benedikt, M., Fan, W., Kuper, G.: Structural properties of XPath fragments. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 79\u201395. Springer, Heidelberg (2002)"},{"key":"28_CR5","volume-title":"The Grammatical Basis of Natural Languages","author":"R. Berwick","year":"1984","unstructured":"Berwick, R., Weinberg, A.: The Grammatical Basis of Natural Languages. MIT Press, Cambridge (1984)"},{"key":"28_CR6","unstructured":"Blackburn, P., Gaiffe, B., Marx, M.: Variable free reasoning on finite trees. In: Proceedings of Mathematics of Language (MOL\u20138), Bloomington (2003)"},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1093\/logcom\/9.3.295","volume":"9","author":"D. Calvanese","year":"1999","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M.: Representing and reasoning on XML documents: A description logic approach. J. of Logic and Computation\u00a09(3), 295\u2013318 (1999)","journal-title":"J. of Logic and Computation"},{"key":"28_CR8","unstructured":"Clarke, E.M., Schlingloff, B.-H.: Model checking. Elsevier Science Publishers, Amsterdam (to appear)"},{"key":"28_CR9","unstructured":"Deutsch, A., Tannen, V.: Containment of regular path expressions under integrity constraints. In: Knowledge Representation Meets Databases (2001)"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"Doner, J.: Tree acceptors and some of their applications. J. Comput. Syst. Sci.\u00a04, 405\u2013451 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"issue":"2","key":"28_CR12","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M. Fisher","year":"1979","unstructured":"Fisher, M., Ladner, R.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci.\u00a018(2), 194\u2013211 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M., Hodkinson, I., Reynolds, M.: Temporal Logic. Mathematical Foundations and Computational Aspects, vol.\u00a01. Oxford Science Publications (1994)","DOI":"10.1093\/oso\/9780198537694.003.0001"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: Proc. 7th ACM Symposium on Principles of Programming Languages, pp. 163\u2013173 (1980)","DOI":"10.1145\/567446.567462"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: Proc. of the 28th International Conference on Very Large Data Bases (VLDB 2002) (2002)","DOI":"10.1016\/B978-155860869-6\/50017-2"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Pichler, R.: The complexity of XPath query evaluation. In: PODS 2003, pp. 179\u2013190 (2003)","DOI":"10.1145\/773153.773171"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C.: Monadic queries over tree-structured data. In: Proc. LICS, Copenhagen (2002)","DOI":"10.1109\/LICS.2002.1029828"},{"key":"28_CR18","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-94-009-6259-0_10","volume-title":"Handbook of Philosophical Logic","author":"D. Harel","year":"1984","unstructured":"Harel, D.: Dynamic logic. In: Gabbay, D.M., Guenther, F. (eds.) Handbook of Philosophical Logic, vol.\u00a02, pp. 497\u2013604. Reidel, Dordrecht (1984)"},{"key":"28_CR19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D. Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)"},{"key":"28_CR20","first-page":"67","volume-title":"Handbook of Theoretical Computer Science","author":"D. Johnson","year":"1990","unstructured":"Johnson, D.: A catalog of complexity classes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 67\u2013161. Elsevier, Amsterdam (1990)"},{"key":"28_CR21","unstructured":"Kamp, J.A.W.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles (1968)"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Results on the propositional mu-calculus. Th. Comp. Science\u00a027 (1983)","DOI":"10.1016\/0304-3975(82)90125-6"},{"issue":"3","key":"28_CR23","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. ACM Transactions on Programming Languages and Systems\u00a019(3), 427\u2013443 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"28_CR24","unstructured":"Marx, M.: XCPath, the expressively complete XPath fragment. Manuscript (July 2003)"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for an XPath fragment. In: Proc. PODS 2002, pp. 65\u201376 (2002)","DOI":"10.1145\/543613.543623"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-36285-1_21","volume-title":"Database Theory - ICDT 2003","author":"F. Neven","year":"2002","unstructured":"Neven, F., Schwentick, T.: XPath containment in the presence of disjunction, DTDs, and variables. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 312\u2013326. Springer, Heidelberg (2002)"},{"key":"28_CR27","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"Pratt, V.: Models of program logics. In: Proceedings FoCS, pp. 115\u2013122 (1979)","DOI":"10.1109\/SFCS.1979.24"},{"key":"28_CR29","first-page":"1","volume":"141","author":"M. Rabin","year":"1969","unstructured":"Rabin, M.: Decidability of second order theories and automata on infinite trees. Transactions of the American Mathematical Society\u00a0141, 1\u201335 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"28_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-36387-4_13","volume-title":"Automata, Logics, and Infinite Games","author":"K. Reinhardt","year":"2002","unstructured":"Reinhardt, K.: The complexity of translating logic to finite automata. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500, pp. 231\u2013238. Springer, Heidelberg (2002)"},{"key":"28_CR31","volume-title":"A descriptive approach to language theoretic complexity","author":"J. Rogers","year":"1998","unstructured":"Rogers, J.: A descriptive approach to language theoretic complexity. CSLI Press, Stanford (1998)"},{"key":"28_CR32","first-page":"31","volume-title":"Ninth Colloquium on Trees in Algebra and Programming","author":"W. Thomas","year":"1984","unstructured":"Thomas, W.: Logical aspects in the study of tree languages. In: Courcelle, B. (ed.) Ninth Colloquium on Trees in Algebra and Programming, pp. 31\u201350. CUP, Cambridge (1984)"},{"key":"28_CR33","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences\u00a032, 183\u2013221 (1986)","journal-title":"Journal of Computer and System Sciences"},{"key":"28_CR34","unstructured":"Wadler, P.: Two semantics for XPath. Technical report, Bell Labs (2000)"},{"key":"28_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-36387-4_12","volume-title":"Automata, Logics, and Infinite Games","author":"M. Weyer","year":"2002","unstructured":"Weyer, M.: Decidability of S1S and S2S. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500, pp. 207\u2013230. Springer, Heidelberg (2002)"},{"key":"28_CR36","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1007\/3-540-44957-4_77","volume-title":"Computational Logic - CL 2000","author":"P. Wood","year":"2000","unstructured":"Wood, P.: On the equivalence of XML patterns. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 1152\u20131166. Springer, Heidelberg (2000)"},{"key":"28_CR37","unstructured":"W3C. Extensible markup language (XML) 1.0, http:\/\/www.w3.org\/TR\/REC-xml"},{"key":"28_CR38","unstructured":"W3C. XML path language (XPath 1.0), http:\/\/www.w3.org\/TR\/xpath.html"},{"key":"28_CR39","unstructured":"W3C. XML path language (XPpath 2.0), http:\/\/www.w3.org\/TR\/xpath20\/"},{"key":"28_CR40","unstructured":"W3C. XML schema part 1: Structures, http:\/\/www.w3.org\/TR\/xmlschema-1"},{"key":"28_CR41","unstructured":"W3C. Xquery 1.0: A query language for XML, http:\/\/www.w3.org\/TR\/\/xquery\/"},{"key":"28_CR42","unstructured":"W3C. XSL transformations language XSLT 2.0, http:\/\/www.w3.org\/TR\/xslt20\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology - EDBT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24741-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T23:22:25Z","timestamp":1711668145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24741-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212003","9783540247418"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24741-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}