Two-variable logic on data trees and XML reasoning

Authors:
Mikoaj Bojańczyk;Anca Muscholl;Thomas Schwentick;Luc Segoufin
Affiliations:
Warsaw University, Warsaw, Poland;LABRI & Universitéé Bordeaux 1, Bordeaux, France;Universität Dortmund, Dortmund, Germany;INRIA & LSV, Cachan, France
Venue:
Journal of the ACM (JACM)
Year:
2009

Citing 26
Cited 35

Finite-memory automata

Theoretical Computer Science
On logics with two variables

Theoretical Computer Science
On the complexity of integer programming

Journal of the ACM (JACM)
On XML integrity constraints in the presence of DTDs

Journal of the ACM (JACM)
Query automata over finite trees

Theoretical Computer Science
XPath Containment in the Presence of Disjunction, DTDs, and Variables

ICDT '03 Proceedings of the 9th International Conference on Database Theory
First-order logic with two variables and unary temporal logic

Information and Computation - Special issue: LICS'97
An algebraic approach to data languages and timed languages

Information and Computation
XML with data values: typechecking revisited

Journal of Computer and System Sciences - Special issu on PODS 2001
Reasoning about keys for XML

Information Systems
Finite state machines for strings over infinite alphabets

ACM Transactions on Computational Logic (TOCL)
Vector Addition Tree Automata

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
XPath satisfiability in the presence of DTDs

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity

TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Small Substructures and Decidability Issues for First-Order Logic with Two Variables

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Two-Variable Logic on Words with Data

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
LTL with the Freeze Quantifier and Register Automata

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Alternation-free modal mu-calculus for data trees

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Efficient algorithms for processing XPath queries

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XPath leashed

ACM Computing Surveys (CSUR)
Satisfiability of XPath queries with sibling axes

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Minimizing tree automata for unranked trees

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
First order paths in ordered trees

ICDT'05 Proceedings of the 10th international conference on Database Theory
Consistency of XML specifications

Inconsistency Tolerance
Deterministic automata on unranked trees

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On the complexity of equational horn clauses

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies

Information Systems
Model checking memoryful linear-time logics over one-counter automata

Theoretical Computer Science
When data dependencies over SQL tables meet the logics of paradox and S-3

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The reachability problem for branching vector addition systems requires doubly-exponential space

Information Processing Letters
On the computational complexity of dominance links in grammatical formalisms

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Two variables and two successors

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the satisfiability of two-variable logic over data words

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Alternating automata on data trees and XPath satisfiability

ACM Transactions on Computational Logic (TOCL)
Efficient reasoning about data trees via integer linear programming

Proceedings of the 14th International Conference on Database Theory
Two-variable logic and key constraints on data words

Proceedings of the 14th International Conference on Database Theory
Two-variable logic on data words

ACM Transactions on Computational Logic (TOCL)
The complexity of text-preserving XML transformations

Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Variable tree automata over infinite ranked alphabets

CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Design by example for SQL table definitions with functional dependencies

The VLDB Journal — The International Journal on Very Large Data Bases
Variable automata over infinite alphabets

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
The implication problem of data dependencies over SQL table definitions: Axiomatic, algorithmic and logical characterizations

ACM Transactions on Database Systems (TODS)
Foundations of XML based on logic and automata: a snapshot

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Feasible automata for two-variable logic with successor on data words

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Model checking languages of data words

FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Deciding twig-definability of node selecting tree automata

Proceedings of the 15th International Conference on Database Theory
Regular path queries on graphs with data

Proceedings of the 15th International Conference on Database Theory
Efficient reasoning about data trees via integer linear programming

ACM Transactions on Database Systems (TODS)
An Automata Model for Trees with Ordered Data Values

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Decidability of Downward XPath

ACM Transactions on Computational Logic (TOCL)
The covering and boundedness problems for branching vector addition systems

Journal of Computer and System Sciences
Enumerating with constant delay the answers to a query

Proceedings of the 16th International Conference on Database Theory
Recursive queries on trees and data trees

Proceedings of the 16th International Conference on Database Theory
Reasoning about functional and full hierarchical dependencies over partial relations

Information Sciences: an International Journal
On XPath with transitive axes and data tests

Proceedings of the 32nd symposium on Principles of database systems
Querying graph databases

Proceedings of the 32nd symposium on Principles of database systems
Armstrong databases: validation, communication and consolidation of conceptual models with perfect test data

APCCM '12 Proceedings of the Eighth Asia-Pacific Conference on Conceptual Modelling - Volume 130
Complexity of two-variable logic on finite trees

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Extending two-variable logic on data trees with order on data values and its automata

ACM Transactions on Computational Logic (TOCL)
Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints

Journal of Automated Reasoning
Two-Variable Logic with Counting and Trees

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Motivated by reasoning tasks for XML languages, the satisfiability problem of logics on data trees is investigated. The nodes of a data tree have a label from a finite set and a data value from a possibly infinite set. It is shown that satisfiability for two-variable first-order logic is decidable if the tree structure can be accessed only through the child and the next sibling predicates and the access to data values is restricted to equality tests. From this main result, decidability of satisfiability and containment for a data-aware fragment of XPath and of the implication problem for unary key and inclusion constraints is concluded.