56 search results - page 4 / 12 » csl 2006 |
131
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
The synthesis of reactive systems requires the solution of two-player games on graphs with -regular objectives. When the objective is specified by a linear temporal logic formula o...
171
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The linear lambda calculus is very weak in terms of expressive power: in particular, all functions terminate in linear time. In this paper we consider a simple extension ...
161
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
140
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
We introduce a new class of multiplicative proof nets, J-proof nets, which are a typed version of Faggian and Maurel's multiplicative L-nets. In J-proof nets, we can character...
177
click to vote
CSL
2006
Springer
15 years 6 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...