A Fuzzy Multi-Agent Problem a Genaral Depiction and its Logic Programming based Application

Resumen

A Multi-Agent Problem (MAP) may be seenas a class of planning and scheduling problems with multiple interacting intelligent agants. These problems may be naturally expressible and solveable by means of solvers of such programming languages as PROLOG.MAP is sometimes fuzzi fied because of a vagueness of information, for example – about abilities and preferences of interacting agents. Simoult aneously, MAP naturally stems from different variants of Constraints Satisfaction Problems (CSP). This property should be preserved in each fuzzy extension of this problem. According to these requirements and expectations – a Fuzzy Multi-Agent Problem (FMAP) – as referred to CSP – and its PROLOG-based solutions are considered in the paper. Finally, a brief discussion of the achieved solutions is also carried out. An effectiveness of this PROLOG-based approach exploitsa multi-valency-based approximation of fuzziness in programming contexts.