Subscribe

Seattle, Washington

Aug. 12, 2006 to Aug. 15, 2006

ISBN: 0-7695-2631-4

pp: 7-16

Mikolaj Bojanczyk , Warsaw University

Anca Muscholl , LIAFA, Paris VII

Thomas Schwentick , Dortmund University

Luc Segoufin , INRIA, Paris XI

Claire David , LIAFA, Paris VII

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2006.51

ABSTRACT

In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semistructured data, timed automata and extended temporal logics. <p>It is shown that satisfiability for the two-variable first-order logic FO^2(~,\le,+1) is decidable over finite and over infinite data words, where ?? is a binary predicate testing the data value equality and +1,\le are the usual successor and order predicates. The complexity of the problem is at least as hard as Petri net reachability. Several extensions of the logic are considered, some remain decidable while some are undecidable.</p>

INDEX TERMS

null

CITATION

Mikolaj Bojanczyk,
Anca Muscholl,
Thomas Schwentick,
Luc Segoufin,
Claire David,
"Two-Variable Logic on Words with Data",

*LICS*, 2006, Logic in Computer Science, Symposium on, Logic in Computer Science, Symposium on 2006, pp. 7-16, doi:10.1109/LICS.2006.51