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: | |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Basel :
Birkhäuser Basel,
2005.
|
| Series: | Whitestein Series in Software Agent Technologies
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
