Constraint Satisfaction Techniques for Agent-Based Reasoning

By 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 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.

• Format: Paperback
• Language: English
• ISBN: 3764372176
• ISBN13: 9783764372170
• Release Date: January 2005
• Publisher: Birkhauser
• Length: 158 Pages
• Weight: 0.56 lbs.
• Dimensions: 0.4" x 6.1" x 9.2"