Distributed and multi-agent systems are becoming more and more the focus of attention in artificial intelligence research and have already found their way into many practical applications. An important prerequisite for their success is an ability to flexibly adapt their behavior via intelligent cooperation. Successful reasoning about and within a multiagent system is therefore paramount to achieve intelligent behavior. Distributed Constraint Satisfaction Problems (DCSPs) and Distributed Constraint Optimization (minimization) Problems (DCOPs) are perhaps ubiquitous in distributed systems in dynamic environments. Many important problems in distributed environments and systems, such as action coordination, task scheduling and resource allocation, can be formulated and solved as DCSPs and DCOPs. Therefore, techniques for solving DCSPs and DCOPs as well as strategies for automated reasoning in distributed systems are indispensable tools in the research areas of distributed and multi-agent systems. They also provide promising frameworks to deal with the increasingly diverse range of distributed real world problems emerging from the fast evolution of communication technologies.The volume is divided in two parts. One part contains papers on distributed constraint problems in multi-agent systems. The other part presents papers on Agents and Automated Reasoning.

Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics.The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages. The handbook gives a reasonably complete coverage of all these lines of work, based on constraint programming, so that a reader can have a rather precise idea of the whole field and its potential. Of course each line of work is dealt with in a survey-like style, where some details may be neglected in favor of coverage. However, the extensive bibliography of each chapter will help the interested readers to find suitable sources for the missing details. Each chapter of the handbook is intended to be a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area.The intended audience of the handbook is researchers, graduate students, higher-year undergraduates and practitioners who wish to learn about the state-of-the-art in constraint programming. No prior knowledge about the field is necessary to be able to read the chapters and gather useful knowledge. Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.The handbook is organized in two parts. The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming.- Covers the whole field of constraint programming- Survey-style chapters- Five chapters on applications

High communication efforts and poor problem solving results due to restricted overview are two central issues in collaborative problem solving. This work addresses these issues by introducing the processes of agent melting and agent splitting that enable individual problem solving agents to continually and autonomously reconfigure and adapt themselves to the particular problem to be solved. The author provides a sound theoretical foundation of collaborative problem solving itself and introduces various new design concepts and techniques to improve its quality and efficiency, such as the multi-phase agreement finding protocol for external problem solving, the composable belief-desire-intention agent architecture, and the distribution-aware constraint specification architecture for internal problem solving. The practical relevance and applicability of the concepts and techniques provided are demonstrated by using medical appointment scheduling as a case study.

Constraint satisfaction problems are significant in the domain of automated reasoning for artificial intelligence. They can be applied to the modeling and solving of a wide range of combinatorial applications such as planning, scheduling and resource sharing in a variety of practical domains such as transportation, production, supply-chains, network management and human resource management. In this book we study new techniques for solving constraint satisfaction problems, with a special focus on solution adaptation applied to agent reasoning.

"This set of books represents a detailed compendium of authoritative, research-based entries that define the contemporary state of knowledge on technology"--Provided by publisher.

This book constitutes the thoroughly refereed post-conference proceedings of the 13th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2010, held in Kolkata, India, in November 2010. The 18 full papers presented together with 15 early innovation papers were carefully reviewed and selected from over 63 submissions. They focus on practical aspects of multiagent systems and cover topics such as agent communication, agent cooperation and negotiation, agent reasoning, agent-based simulation, mobile and semantic agents, agent technologies for service computing, agent-based system development, ServAgents workshop, IAHC workshop, and PRACSYS workshop.

In the era of ubiquitous computing and networking, millions of electronic devices with computing facilities in the public space are connected with each other in ad hoc ways, but are required to behave coherently. Massively multi-agent systems, MMAS can be a major design paradigm or an implementation method for ubiquitous computing and ambient intelligence. As the infrastructure of massively multi-agent systems, technologies such as grid computing together with semantic annotation can be combined with agent technology. A new system design approach, society-centered design, may be realized by embedding participatory technologies in human society. This book originates from the First International Workshop on Massively Multi-Agent Systems, MMAS 2004, held in Kyoto, Japan in December 2004. The 25 revised full selected and invited papers give an excellent introduction and overview on massively multi-agent systems. The papers are organized in parts on massively multi-agent technology, teams and organization, ubiquitous computing and ambient intelligence, and massively multi-agent systems in the public space.

De par leur forte complexité et leur omniprésence aussi bien dans le monde académique qu’industriel, les problèmes de satisfaction de contraintes (CSP) continuent à susciter l'intérêt des scientifiques dans les domaines de la recherche opérationnelle et de l’intelligence artificielle. Un CSP comporte un ensemble de variables ayant chacune un domaine de valeurs ainsi qu'un ensemble de contraintes, l’objectif étant d’instancier les variables de manière à satisfaire toutes les contraintes. Formalismes, techniques et extensions relatives aux CSP sont détaillés et illustrés par des exemples didactiques tels que le problème des 4-reines. Problèmes de satisfaction de contraintes s’adresse aux ingénieurs en leur facilitant l’accès à ce domaine, aux chercheurs en leur exposant les notions de base tout en leur apportant une bibliographie étendue, et aux enseignants et étudiants en leur fournissant un support de cours.

This book constitutes the refereed proceedings of the 14th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2017, held in Espoo, Finland, in July 2017. The 16 full papers and 11 short papers presented in this volume were carefully reviewed and selected from 47 submissions. The book also contains 4 invited talks. The papers were organized in topical sections named: nonmonotonic reasoning; answer set programming; LPNMR systems; and LPNMR applications.

Comprehensive coverage of critical issues related to information science and technology.