4573 search results - page 690 / 915 » Automated Reasoning |
129
Voted
TARK
2007
Springer
15 years 9 months ago
2007
Springer
In this paper is we apply insights from mechanism design to the design of agent interaction protocols. We show how this allows us a more flexible approach to the design of agent ...
134
click to vote
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
— 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...
108
click to vote
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
141
click to vote
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...