<> "The repository administrator has not yet configured an RDF license."^^ . <> . . . "Constraint relaxation approach for over-constrained agent interaction"^^ . "The interactions among agents in a multi-agent system for coordinating a distributed, problem solving task can be complex, as the distinct sub-problems of the individual agents are interdependent. A distributed protocol provides the necessary framework for specifying these interactions. In a model of interactions where the agents' social norms are expressed as the message passing behaviours associated with roles, the dependencies among agents can be specified as constraints. The constraints are associated with roles to be adopted by agents as dictated by the protocol. These constraints are commonly handled using a conventional constraint solving system that only allows two satisfactory states to be achieved - completely satisfied or failed. Agent interactions then become brittle as the occurrence of an over-constrained state can cause the interaction between agents to break prematurely, even though the interacting agents could, in principle, reach an agreement. Assuming that the agents are capable of relaxing their individual constraints to reach a common goal, the main issue addressed by this research work is how the agents could communicate and coordinate the constraint relaxation process. The interaction mechanism for this is obtained by reinterpreting a technique borrowed from the constraint satisfaction field (i.e. distributed partial Constraint Satisfaction Problem), deployed and computed at the protocol level. © 2008 Springer Berlin Heidelberg."^^ . "2008" . . "5351 L" . . "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"^^ . . . "03029743" . . . . . . . . . . "M.F."^^ . "Hassan"^^ . "M.F. Hassan"^^ . . "D."^^ . "Robertson"^^ . "D. Robertson"^^ . . . . . "HTML Summary of #414 \n\nConstraint relaxation approach for over-constrained agent interaction\n\n" . "text/html" . .