Constraint Satisfaction Techniques for Agent-Based Reasoning
Springer Basel (Verlag)
9783764372170 (ISBN)
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.
Interchangeability and Solution Adaptation in Crisp CSPs.- Interchangeability in Soft CSPs.- Multi Agent Computation of Interchangeability in Distributed CSPs.- Interchangeability in Dynamic Environments.- Generic Case Adaptation Framework.- Conclusions.
| Erscheint lt. Verlag | 28.1.2005 |
|---|---|
| Reihe/Serie | Whitestein Series in Software Agent Technologies and Autonomic Computing |
| Zusatzinfo | XII, 158 p. |
| Verlagsort | Basel |
| Sprache | englisch |
| Maße | 170 x 244 mm |
| Gewicht | 352 g |
| Themenwelt | Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik |
| Schlagworte | Agents • Artificial Intelligence • automated reasoning • COND040 • Constraint Satisfaction • constraint satisfaction problem • Constraint Satisfaction Problems • Hardcover, Softcover / Informatik, EDV/Allgemeines, Lexika • HC/Informatik, EDV/Allgemeines, Lexika • HC/Informatik, EDV/Informatik • Intelligence • Künstliche Intelligenz • Management • Modeling • Multi Agent Systems • Problem Solving |
| ISBN-13 | 9783764372170 / 9783764372170 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
