The research on exception handling in Multi-Agent Systems has produced some advanced models to deal with `exceptional situations'. The expression `agent exception' is how...
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
— A reconfigurable robot is a robot that can change shape. Programming reconfigurable robots is complicated by the need to adapt the behavior of each of the individual module t...
Ulrik Pagh Schultz, Mirko Bordignon, David Johan C...