Axiomatizations for downward XPath on data trees

We give sound and complete axiomatizations for XPath with data tests by "equality" or "inequality", and containing the single "child" axis. This data-aware logic predicts over data trees, which are tree-like structures whose every node contains a label from a finite alphabet and a data value from an infinite domain. The language allows us to compare data values of two nodes but cannot access the data values themselves (i.e. there is no comparison by constants). Our axioms are in the style of equational logic, extending the axiomatization of data-oblivious XPath, by B. ten Cate, T. Litak and M. Marx. We axiomatize the full logic with tests by "equality" and "inequality", and also a simpler fragment with "equality" tests only. Our axiomatizations apply both to node expressions and path expressions. The proof of completeness relies on a novel normal form theorem for XPath with data tests.

[1]  References , 1971 .

[2]  Thomas Schwentick,et al.  Two-variable logic on data trees and XML reasoning , 2009, JACM.

[3]  David Baelde,et al.  A Sequent Calculus for a Modal Logic on Finite Data Trees , 2016, CSL.

[4]  Steven J. DeRose,et al.  XML Path Language (XPath) , 1999 .

[5]  Bernhard Beckert,et al.  Dynamic Logic , 2007, The KeY Approach.

[6]  Santiago Figueira,et al.  Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization , 2015, J. Artif. Intell. Res..

[7]  Christel Baier,et al.  Principles of model checking , 2008 .

[8]  Santiago Figueira,et al.  Model theory of XPath on data trees. Part II: Binary bisimulation and definability , 2017, Inf. Comput..

[9]  Wenfei Fan,et al.  Satisfiability of XPath Queries with Sibling Axes , 2005, DBPL.

[10]  Leonid Libkin,et al.  Regular path queries on graphs with data , 2012, ICDT '12.

[11]  Kousha Etessami,et al.  Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.

[12]  Santiago Figueira,et al.  Basic Model Theory of XPath on Data Trees , 2014, ICDT.

[13]  Balder ten Cate,et al.  Axiomatizing the Logical Core of XPath 2.0 , 2007, Theory of Computing Systems.

[14]  E. V. Huntington.  A New Set of Independent Postulates for the Algebra of Logic with Special Reference to Whitehead and Russell's Principia Mathematica. , 1932, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Santiago Figueira,et al.  Bisimulations on Data Graphs , 2016, KR.

[16]  Diego Figueira,et al.  Decidability of Downward XPath , 2012, TOCL.

[17]  Santiago Figueira,et al.  Definability for Downward and Vertical XPath on Data Trees , 2014, WoLLIC.

[18]  E. V. Huntington.  Boolean algebra. A correction to: “New sets of independent postulates for the algebra of logic, with special reference to Whitehead and Russell’s Principia mathematica” [Trans. Amer. Math. Soc. 35 (1933), no. 1, 274–304; 1501684] , 1933 .

[19]  Gabriel M. Kuper,et al.  Structural properties of XPath fragments , 2003, Theor. Comput. Sci..

[20]  Balder ten Cate,et al.  Some modal aspects of XPath , 2010, J. Appl. Non Class. Logics.

[21]  Kit Fine,et al.  Normal forms in modal logic , 1975, Notre Dame J. Formal Log..

[22]  Luca Cardelli,et al.  TQL: A Query Language for Semistructured Data Based on the Ambient Logic , 2003 .

[23]  Maarten Marx,et al.  Complete axiomatizations for XPath fragments , 2010, J. Appl. Log..

[24]  Sergei N. Artëmov,et al.  Data Storage Interpretation of Labeled Modal Logic , 1996, Ann. Pure Appl. Log..