Overview
- Study of new techniques for solving constraint satisfaction problems
- Special focus on solution adaptation applied to agent reasoning
Part of the book series: Whitestein Series in Software Agent Technologies and Autonomic Computing (WSSAT)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
Table of contents (7 chapters)
Authors and Affiliations
Bibliographic Information
Book Title: Constraint Satisfaction Techniques for Agent-Based Reasoning
Authors: Nicoleta Neagu
Series Title: Whitestein Series in Software Agent Technologies and Autonomic Computing
DOI: https://doi.org/10.1007/b137139
Publisher: Birkhäuser Basel
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Birkhäuser Basel 2005
Softcover ISBN: 978-3-7643-7217-0Published: 28 January 2005
eBook ISBN: 978-3-7643-7319-1Published: 30 March 2006
Edition Number: 1
Number of Pages: XII, 158