Constraint Satisfaction Techniques for Agent-Based Reasoning

• Κύριος συγγραφέας: Neagu, Nicoleta (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Basel : Birkhäuser Basel, 2005.
• Σειρά: Whitestein Series in Software Agent Technologies
• Θέματα: Computer science.; Artificial intelligence.; Computer Science.; Artificial Intelligence (incl. Robotics).; Computer Science, general.

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...

Πίνακας περιεχομένων:

• 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.