论文信息 - FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems

FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems

A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(<,+1,~) over data trees. Here +1 refers to the child and the next sibling relations while < refers to the descendant and following sibling relations. Moreover, ~ is a binary predicate testing data equality. We exhibit an automata model, denoted DAD# that is more expressive than FO2(<,+1,~) but such that emptiness of DAD# and satisfiability of FO2(<,+1,~) are inter-reducible. This is proved via a model of counter tree automata, denoted EBVASS, that extends Branching Vector Addition Systems with States (BVASS) with extra features for merging counters. We show that, as decision problems, reachability for EBVASS, satisfiability of FO2(<,+1,~) and emptiness of DAD# are equivalent.

Florent Jacquemard | Luc Segoufin | Jerémie Dimino

[1] Marcin Jurdzinski,et al. Alternating automata on data trees and XPath satisfiability , 2008, TOCL.

[2] Sylvain Schmitz. On the Computational Complexity of Dominance Links in Grammatical Formalisms , 2010, ACL.

[3] Diego Figueira,et al. Forward-XPath and extended register automata on data-trees , 2010, ICDT '10.

[4] Thomas Schwentick,et al. On Notions of Regularity for Data Languages , 2007, FCT.

[5] Slawomir Lasota,et al. An Extension of Data Automata that Captures XPath , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[6] Diego Figueira,et al. Satisfiability of downward XPath with data equality tests , 2009, PODS.

[7] C. Aiswarya,et al. Model Checking Languages of Data Words , 2012, FoSSaCS.

[8] Thomas Schwentick,et al. Two-variable logic on data words , 2011, TOCL.

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

[10] Hubert Comon,et al. Tree automata techniques and applications , 1997 .

[11] Patricia Bouyer,et al. A logical characterization of data languages , 2002, Inf. Process. Lett..

[12] Nissim Francez,et al. Finite-Memory Automata , 1994, Theor. Comput. Sci..

[13] Diego Figueira,et al. Bottom-up automata on data trees and vertical XPath , 2011, Log. Methods Comput. Sci..

[14] Stéphane Demri,et al. LTL with the Freeze Quantifier and Register Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).