Constraint Satisfaction Techniques for Agent-Based Reasoning
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...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Basel
Birkhäuser
2005, 2005
|
| Edition: | 1st ed. 2005 |
| Series: | Whitestein Series in Software Agent Technologies and Autonomic Computing
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
| Summary: | 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 |
|---|---|
| Physical Description: | XII, 158 p online resource |
| ISBN: | 9783764373191 |