Finite-state unification automata and relational languages
Information and Computation
Theoretical Computer Science
Over words, two variables are as powerful as one quantifier alternation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Theoretical Computer Science
Shuffle languages, Petri nets, and context-sensitive grammars
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Partially-Ordered Two-Way Automata: A New Characterization of DA
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
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
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
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
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
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
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Shuffle expressions and words with nested data
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A succinct canonical register automaton model
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Regular expressions for data words
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Model checking languages of data words
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
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
A succinct canonical register automaton model for data domains with binary relations
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Walk logic as a framework for path query languages on graph databases
Proceedings of the 16th International Conference on Database Theory
Foundations of data-aware process analysis: a database theory perspective
Proceedings of the 32nd symposium on Principles of database systems
Graph Reachability and Pebble Automata over Infinite Alphabets
ACM Transactions on Computational Logic (TOCL)
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic (TOCL)
Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
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 |
In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. This model has been already considered in the realm of semistructured data, timed automata, and extended temporal logics. This article shows that satisfiability for the two-variable fragment FO2(∼,