4573 search results - page 268 / 915 » Automated Reasoning |
168
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...
144
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...
134
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...
146
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
For a two-variable formula (X, Y ) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of an operator Y = F(X) such that (X, F(X)) ...
140
click to vote
DEON
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. By making use of modal logic techniques, the paper disentangles two semantically different readings of statements of the type X counts as Y in context C (the classificato...