Constraint satisfaction techniques for agent-based reasoning.

From MaRDI portal





The book is devoted to the reasoning methods of intelligent agent systems that they apply during their decision process. The reasoning methods studied in the book are mainly based on constraint satisfaction methods and case-based reasoning techniques. The book is divided into 7 chapters. The main subjects presented in each chapter are described in the following. Chapter 1 is an introduction to the problem and to some basic concepts. Chapter 2 contains a formal framework for interchangeability in crisp Constraint Satisfaction Problems (CSP) and algorithms for its computation. A new form of interchangeability called tuple interchangeability is defined here and algorithms for its computation are given. Chapter 3 extends various forms of interchangeability from crisp CSP to the Soft CSP framework (SCSP) and algorithms for its computation are given. The SCSP allows one to deal with features like fuzziness, partial satisfaction, uncertainty. Chapter 4 focuses on a distributed constraint satisfaction problem. In this problem variables and constraints are distributed among multiple agents. In this book search algorithms, consistency algorithms and search algorithms for value symmetries for distributed problems are studied. Chapter 5 is about transformations of the algorithms for computing interchangeability to dynamic environments where the knowledge of the problem may evolve in time. In Chapter 6 a generic framework is described for the case adaptation process in case-based reasoning systems. Chapter 7 contains conclusions and comments on further research.











This page was built for publication: Constraint satisfaction techniques for agent-based reasoning.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4663948)