56 search results - page 2 / 12 » On the Satisfiability of Two-Variable Logic over Data Words |
CSL
2006
Springer
13 years 4 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
FUIN
2007
13 years 4 months ago
2007
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
PODS
2009
ACM
14 years 5 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
CSL
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...