| Revista: | Computación y sistemas |
| Base de datos: | |
| Número de sistema: | 000560492 |
| ISSN: | 1405-5546 |
| Autores: | Jobczyk, Krystian1 Gałczyński, Patryk1 Ligęza, Antoni1 |
| Instituciones: | 1University of Science and Technology, Department of Applied Computer Science, Varsovia. Polonia |
| Año: | 2020 |
| Periodo: | Abr-Jun |
| Volumen: | 24 |
| Número: | 2 |
| Paginación: | 453-467 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Resumen en inglés | A Multi-Agent Problem (MAP) may be seen as 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 fuzzified because of a vagueness of information, for example – about abilities and preferences of interacting agents. Simoultaneously, 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 exploits a multi-valency-based approximation of fuzziness in programming contexts. |
| Disciplinas: | Ciencias de la computación |
| Palabras clave: | Inteligencia artificial |
| Keyword: | Multi-agent problem, Fuzzy multi-agent problem, Logic programming, PROLOG, Simple temporal problem under uncertainty, Artificial intelligence |
| Texto completo: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
