Languages, automata, and logic
Handbook of formal languages, vol. 3
Journal of the ACM (JACM)
On the complexity of integer programming
Journal of the ACM (JACM)
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
An Algebraic Characterization of Data and Timed Languages
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Some Applications of CFL's over Infinte Alphabets
Proceedings of the 5th GI-Conference on Theoretical Computer Science
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Journal of Computer and System Sciences
Alternation-free modal mu-calculus for data trees
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
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)
Satisfiability of downward XPath with data equality tests
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Graph Reachability and Pebble Automata over Infinite Alphabets
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
On Pebble Automata for Data Languages with Decidable Emptiness Problem
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Tree automata over infinite alphabets
Pillars of computer science
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Two-variable logic and key constraints on data words
Proceedings of the 14th International Conference on Database Theory
An automaton over data words that captures EMSO logic
CONCUR'11 Proceedings of the 22nd international conference on Concurrency 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
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 |
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels from an infinite alphabet (data). While in general logics such as MSO or FO are undecidable for such extensions, decidablity results for their fragments have been obtained recently, most notably for the two-variable fragments of FO and existential MSO. The proofs, however, are very long and non-trivial, and some of them come with no complexity guarantees. Here we give a much simplified proof of the decidability of two-variable logics for data words with the successor and data-equality predicates. In addition, the new proof provides several new fragments of lower complexity. The proof mixes database-inspired constraints with encodings in Presburger arithmetic.