Sciweavers

Share
58 search results - page 1 / 12
» On the Satisfiability of Two-Variable Logic over Data Words
Sort
View
LPAR
2010
Springer
8 years 4 months ago
On the Satisfiability of Two-Variable Logic over Data Words
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 ...
Claire David, Leonid Libkin, Tony Tan
CSL
2010
Springer
8 years 7 months ago
Two-Variable Logic with Two Order Relations - (Extended Abstract)
d Abstract) Thomas Schwentick and Thomas Zeume TU Dortmund University The finite satisfiability problem for two-variable logic over structures with unary relations and two order re...
Thomas Schwentick, Thomas Zeume
LICS
2006
IEEE
9 years 10 days ago
Two-Variable Logic on Words with Data
— 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 semi...
Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentic...
CORR
2008
Springer
141views Education» more  CORR 2008»
8 years 6 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
CORR
2007
Springer
135views Education» more  CORR 2007»
8 years 6 months ago
On the decidability and complexity of Metric Temporal Logic over finite words
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
Joël Ouaknine, James Worrell
books