50 search results - page 10 / 10 » Fragments of First-Order Logic over Infinite Words |
187
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
190
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
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...
186
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
211
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
182
click to vote
GPCE
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. SafeGen is a meta-programming language for writing statically safe generators of Java programs. If a program generator written in SafeGen passes the checks of the SafeGen...