Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide a...
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
Abstract. A fundamental and unanalysed logical concept is substitution. This seemingly innocuous operation -- substituting a variable for a term or valuating a variable to an eleme...
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher