Theoretical Computer Science
Theoretical Computer Science
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
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
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An algorithm for the general Petri net reachability problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
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
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Static analysis of xml transformation and schema languages
Static analysis of xml transformation and schema languages
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Model checking memoryful linear-time logics over one-counter automata
Theoretical 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 on data words
ACM Transactions on Computational Logic (TOCL)
When model-checking freeze LTL over counter machines becomes decidable
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
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
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
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By developing an appropriate automaton model, we show that under this assumption various formalisms, including a two variable first-order logic and a subset of XPath, have decidable emptiness problems.