Efficient reasoning about data trees via integer linear programming

Author:

David Claire1,Libkin Leonid2,Tan Tony2

Affiliation:

1. Université Paris-Est, France

2. University of Edinburgh, UK

Abstract

Data trees provide a standard abstraction of XML documents with data values: they are trees whose nodes, in addition to the usual labels, can carry labels from an infinite alphabet (data). Therefore, one is interested in decidable formalisms for reasoning about data trees. While some are known—such as the two-variable logic—they tend to be of very high complexity, and most decidability proofs are highly nontrivial. We are therefore interested in reasonable complexity formalisms as well as better techniques for proving decidability. Here we show that many decidable formalisms for data trees are subsumed—fully or partially—by the power of tree automata together with set constraints and linear constraints on cardinalities of various sets of data values. All these constraints can be translated into instances of integer linear programming, giving us an NP upper bound on the complexity of the reasoning tasks. We prove that this bound, as well as the key encoding technique, remain very robust, and allow the addition of features such as counting of paths and patterns, and even a concise encoding of constraints, without increasing the complexity. The NP bound is tight, as we also show that the satisfiability of a single set constraint is already NP-hard. We then relate our results to several reasoning tasks over XML documents, such as satisfiability of schemas and data dependencies and satisfiability of the two-variable logic. As a final contribution, we describe experimental results based on the implementation of some reasoning tasks using the SMT solver Z3.

Funder

Seventh Framework Programme

Engineering and Physical Sciences Research Council

Publisher

Association for Computing Machinery (ACM)

Subject

Information Systems

Reference36 articles.

1. XML with data values: typechecking revisited

2. On the Complexity of Verifying Consistency of XML Specifications

3. XML data exchange

4. Björklund H. Martens W. and Schwentick T. 2008. Optimizing conjunctive queries over trees using schema information. In Mathematical Foundations of Computer Science. Springer 132--143. 10.1007/978-3-540-85238-4_10 Björklund H. Martens W. and Schwentick T. 2008. Optimizing conjunctive queries over trees using schema information. In Mathematical Foundations of Computer Science. Springer 132--143. 10.1007/978-3-540-85238-4_10

5. Two-variable logic on data words

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Parikh’s Theorem Made Symbolic;Proceedings of the ACM on Programming Languages;2024-01-05

2. CSS Minification via Constraint Solving;ACM Transactions on Programming Languages and Systems;2019-06-21

3. Satisfiability of Xpath on data trees;ACM SIGLOG News;2018-04-30

4. Forward and backward application of symbolic tree transducers;Acta Informatica;2014-03-21

5. Extending two-variable logic on data trees with order on data values and its automata;ACM Transactions on Computational Logic;2014-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3