Theoretical Computer Science
First-order logic with two variables and unary temporal logic
Information and Computation - Special issue: LICS'97
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
On the Complexity of Verifying Consistency of XML Specifications
SIAM Journal on Computing
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
On notions of regularity for data languages
Theoretical Computer Science
Forward-XPath and extended register automata on data-trees
Proceedings of the 13th International Conference on Database Theory
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
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
First order paths in ordered trees
ICDT'05 Proceedings of the 10th international conference on Database Theory
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
Reasoning about Data Repetitions with Counter Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The paper introduces key constraints for data words and shows that it is decidable whether, for a given two-variable sentence ϕ that can refer to the successor relation on positions and a set Κ of key constraints, there is a data string w that satisfies ϕ and respects Κ. Here, the formula is allowed to refer to the successor relation but not to the linear order on the positions of the word. As a byproduct, a self-contained exposition of an algorithm that decides satisfiability of such formulas (without key constraints) in 2-nexptime is given.