This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
Agents based on reactive planning architectures use pre-specified plans as behaviour specifications. Normative agents are motivated by norms in their behaviour: obligations motiva...
Automatic and non-invasive web personalization seems to be a challenge for nowadays web sites. Many web mining techniques are used to achieve this goal. Since current web sites evo...
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...