https://scholars.lib.ntu.edu.tw/handle/123456789/490120
標題: | Extending two-variable logic on data trees with order on data values and its automata. | 作者: | TONY TAN | 關鍵字: | Data trees; Finite-state automata; Ordered data values; Two-variable logic | 公開日期: | 2014 | 卷: | 15 | 期: | 1 | 來源出版物: | ACM Transactions on Computational Logic | 摘要: | Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value from an infinite domain. They have been used as an abstraction model for reasoning tasks on XML and verification. However, most existing approaches consider the case where only equality test can be performed on the data values. In this article we study data trees in which the data values come from a linearly ordered domain, and in addition to equality test, we can test whether the data value in a node is greater than the one in another node. We introduce an automata model for them which we call ordered-data tree automata (ODTA), provide its logical characterisation, and prove that its non-emptiness problem is decidable in 3-NEXPTIME. We also show that the two-variable logic on unranked data trees, studied by Bojanczyk et al. [2009], corresponds precisely to a special subclass of this automata model. Then we define a slightly weaker version of ODTA, which we call weak ODTA, and provide its logical characterisation. The complexity of the non-emptiness problem drops to NP. However, a number of existing formalisms and models studied in the literature can be captured already by weak ODTA. We also show that the definition of ODTA can be easily modified, to the case where the data values come from a tree-like partially ordered domain, such as strings. © 2014 ACM. |
URI: | https://scholars.lib.ntu.edu.tw/handle/123456789/490120 https://www.scopus.com/inward/record.uri?eid=2-s2.0-84897706379&doi=10.1145%2f2559945&partnerID=40&md5=1855e6f093b0af0f32c9e1490a84ca43 |
ISSN: | 15293785 | DOI: | 10.1145/2559945 | SDG/關鍵字: | Abstraction model; Automata models; Data tree; Finite alphabet; Finite-state automata; Infinite domains; Ordered data; Two-variable logic; Automata theory; Forestry; Trees (mathematics); Algorithms; Data Bases; Mathematical Models; Problem Solving |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。