Constraint satisfaction techniques for agent-based reasoning / Nicoleta Neagu.
"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 s...
Saved in:
| Main Author: | |
|---|---|
| Format: | Ebook |
| Language: | English |
| Published: |
Basel ; Boston :
Birkhäuser,
[2005]
|
| Series: | Whitestein series in software agent technologies.
|
| Subjects: | |
| Online Access: | Springer eBooks |
| 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."--Publisher's website. |
|---|---|
| Physical Description: | 1 online resource (x, 157 pages) : illustrations. |
| Bibliography: | Includes bibliographical references. |