Theoretical Computer Science
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
Information Systems
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
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
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
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
Testing XML constraint satisfiability
Electronic Notes in Theoretical Computer Science (ENTCS)
On deciding well-definedness for query languages on trees
Journal of the ACM (JACM)
Reasoning about XML update constraints
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Static analysis of XML processing with data values
ACM SIGMOD Record
XPath evaluation in linear time
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimizing Conjunctive Queries over Trees Using Schema Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Complexity of Data Tree Patterns over XML Documents
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Reasoning about XML with Temporal Logics and Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reasoning about XML update constraints
Journal of Computer and System Sciences
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The finite model theory toolbox of a database theoretician
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Satisfiability of downward XPath with data equality tests
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A generic framework for reasoning about dynamic networks of infinite-state processes
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Finding your way in a forest: on different types of trees and their properties
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Model checking freeze LTL over one-counter automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Forward-XPath and extended register automata on data-trees
Proceedings of the 13th International Conference on Database Theory
Safety alternating automata on data words
ACM Transactions on Computational Logic (TOCL)
Two-variable logic on data words
ACM Transactions on Computational Logic (TOCL)
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Finite automata over structures
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Satisfiability of a spatial logic with tree variables
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Unranked tree automata with sibling equalities and disequalities
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
Motivated by reasoning tasks in the context of 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.