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...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Basel :
Birkhäuser Basel,
2005.
|
Σειρά: | Whitestein Series in Software Agent Technologies
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Περίληψη: | 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. |
---|---|
Φυσική περιγραφή: | XII, 158 p. online resource. |
ISBN: | 9783764373191 |