Axiomatizing the logical core of XPath 2.0

Theory of Computing Systems

Volumn 44, Issue 4, 2009, Pages 561-589

  Ten Cate, Balder ^a   Marx, Maarten ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Axiomatization; Query rewriting; XML; XPath

Indexed keywords

AXIOMATIZATION; AXIOMATIZING; QUERY EQUIVALENCE; QUERY REWRITINGS; UNDECIDABILITY; XPATH;

MATHEMATICAL TECHNIQUES; XML;

COMPUTER SCIENCE;

EID: 67349205435     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-008-9151-9     Document Type: Article

References (28)

1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
2. R. Backofen J. Rogers K. Vijay-Shanker 1995 A first-order axiomatization of the theory of finite trees J. Logic Lang. Inf. 4 1 5 39
3. Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. J. Assoc. Comput. Mach. 55(2), (2008)
4. M. Benedikt W. Fan G. Kuper 2005 Structural properties of XPath fragments Theor. Comput. Sci. 336 1 3 31 (Pubitemid 36140624)
5. Berghammer, R., Schmidt, G., Winter, M.: RelView and Rath-two systems for dealing with relations. In: Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol. 2929, pp. 1-16. Springer, Berlin (2003) (Pubitemid 38069559)
6. Bojanczyk, M., Muscholl, A., Schwentick, Th., Segoufin, L., David, C.: Two-variable logic on words with data. In: Proceedings LICS'06, pp. 7-16 (2006)
7. Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Berlin (1997)
8. Dawar, A.: How many first-order variables are needed on finite ordered structures? In: Artemov, S., et al. (eds.) We will Show Them: Essays in Honour of Dov Gabbay, pp. 489-520. College Publications, Woodend Vic. (2005)
9. Doets, H.C.: Completeness and definability: applications of the ehrenfeucht game in intensional and second-order logic. Ph.D. Thesis, Department of Mathematics and Computer Science, University of Amsterdam (1987)
10. Geerts, F., Fan, W.: Satisfiability of XPath queries with sibling axes. In: Proceedings DBPL'05, pp. 122-137 (2005)
11. Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: VLDB'02, pp. 95-106 (2002)
12. Gyssens, M., Paredaens, J., Van Gucht, D., Fletcher, G.: Structural characterizations of the semantics of XPath as navigation tool on a document. In: Proceedings PODS'06, pp. 318-327 (2006)
13. Henkin, L., Monk, J.D., Tarski, A.: Cylindric Algebras, Part II. North-Holland, Amsterdam (1985)
14. Hidders, J.: Satisfiability of XPath expressions. In: Proceedings DBPL. LNCS, vol. 2921, pp. 21-36. Springer, Berlin (2003) (Pubitemid 38203692)
15. Hirsch, R., Hodkinson, I.: Relation algebras by games. In: Studies in Logic and the Foundations of Mathematics, vol. 147. North-Holland, Amsterdam (2002)
16. Kay, M.: XPath 2.0 Programmer's Reference. Wrox (2004)
17. R.C. Lyndon 1950 The representation of relation algebras Ann. Math. 51 707 729
18. R.C. Lyndon 1956 The representation of relation algebras, Part II Ann. Math. 63 294 307
19. M. Marx 2005 Conditional XPath ACM Trans. Database Syst. (TODS) 30 4 929 959 (Pubitemid 43909008)
20. A. Tarski 1941 On the calculus of relations J. Symb. Log. 6 73 89
21. Tarski, A., Givant, S.: A Formalization of Set Theory without Variables. AMS Colloquium Publications, vol. 41. Rhode Island, Providence (1987)
22. ten Cate, B., Litak, T., Marx, M.: Complete axiomatizations for XPath fragments. In: Proceedings LID (Logic in Databases) Rome, Italy, 19-20 May 2008
23. ten Cate, B., Lutz, C.: The complexity of query containment in expressive fragments of XPath 2.0. In: Proceedings PODS'07 (2007)
24. Venema, Y.: Many-dimensional modal logic. Ph.D. Thesis, Institute for Logic, Language and Computation, University of Amsterdam (1992)
25. Venema, Y.: Completeness by completeness: since and until. In: de Rijke, M. (ed.) Diamonds and Defaults, pp. 349-358. Kluwer Academic, Dordrecht (1993)
26. Y. Venema 1993 Derivation rules as anti-axioms in modal logic J. Symb. Log. 58 3 1003 1034
27. Venema, Y.: Completeness through flatness. In: Gabbay, D., Ohlbach, H.J. (eds.) Temporal Logic, First International Conference ICTL'94, pp. 149-164 (1994)
28. Y. Venema 1995 Cylindrical modal logic J. Symb. Log. 60 2 591 623