First order paths in ordered trees

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

Volumn 3363 LNCS, Issue , 2005, Pages 114-128

  Marx, Maarten ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; COMPLEMENTATION; CONJUNCTIVE QUERIES; FIRST ORDER; FIRST ORDER LOGIC; LABELED TREES; NAVIGATIONAL XPATH; ORDERED TREE; SUFFICIENT CONDITIONS; TRANSITIVE CLOSURE; VARIABLE FRAGMENT;

LINGUISTICS; NAVIGATION;

QUERY LANGUAGES;

EID: 77049106361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30570-5_8     Document Type: Conference Paper

References (18)

1. M. Benedikt, W. Fan, and G. Kuper. Structural properties of XPath fragments. In Proceedings. ICDT 2003, 2003.
2. P. Blackburn, W. Meyer-Viol, and M. de Rijke. A proof system for finite trees. In H. Kleine Büning, editor, Computer Science Logic, volume 1092 of LNCS, pages 86-105. Springer, 1996.
3. World-Wide Web Consortium. XML path language (XPath): Version 1.0. http://www.w3.org/TR/xpath.html.
4. K. Etessami, M. Vardi, and Th. Wilke. First-order logic with two variables and unary temporal logic. In Proc. LICS'97, pages 228-235, 1997.
5. G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In VLDB'02, 2002.
6. G. Gottlob, C. Koch, and K. Schulz. Conjunctive queries over trees. In Proceedings of PODS, pages 189-200, 2004.
7. A. Halevy and M. Rousset. Combining horn rules and description logics in CARIN. Artificial Intelligence, 104:165-209, 1998.
8. I. Hodkinson and A Simon. The k-variable property is stronger than H-dimension k. Journal of Philosophical Logic, 26:81-101, 1997.
9. N. Immerman and D. Kozen. Definability with bounded number of bound variables. In Proceedings of the Symposium of Logic in Computer Science, pages 236-244, Washington, 1987. Computer Society Press.
10. J.A.W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, 1968.
11. M. Marx. Conditional XPath, the first order complete XPath dialect. In Proceedings of PODS'04, pages 13-22, 2004.
12. M. Marx. XPath with conditional axis relations. In Proceedings of EDBT'04, volume 2992 of LNCS, pages 477-494, 2004.
13. M. Marx and M. de Rijke. Semantic characterizations of XPath. In TDM'04 workshop on XML Databases and Information Retrieval., Twente, The Netherlands, June 21, 2004.
14. A. Palm. Propositional tense logic for trees. In Sixth Meeting on Mathematics of Language. University of Central Florida, Orlando, Florida, 1999.
15. J. Rogers. A Descriptive Approach to Language Theoretic Complexity. CSLI Press, 1998.
16. A. Tarski and S. Givant. A Formalization of Set Theory without Variables, volume 41. AMS Colloquium publications, Providence, Rhode Island, 1987.
17. M. Vardi. Why is modal logic so robustly decidable? In DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31, pages 149-184. American Math. Society, 1997.
18. P. Wadler. Two semantics for XPath. Technical report, Bell Labs, 2000.