Constraint Satisfaction Techniques for Agent-Based Reasoning

2005
ISBN: 978-3-7643-7217-0
Verlag: Springer

Buch, Englisch, 158 Seiten, Format (B × H): 155 mm x 233 mm, Gewicht: 272 g

Reihe: Whitestein Series in Software Agent Technologies and Autonomic Computing

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.

Zielgruppe

Research

Autoren/Hrsg.

Neagu, Nicoleta

Fachgebiete

• Mathematik | Informatik EDV | Informatik EDV & Informatik Allgemein
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme

Inhaltsverzeichnis

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.