A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
— The dynamic composition of systems of networked appliances, or virtual devices, enables users to generate complex strong specific systems. Current prominent MANET-based composi...
Formal theories of multi-agent systems require a rich ontology for modelling the dynamics of social behaviour. In this paper a formal analysis of the social behaviour of individua...
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...