Constraint Satisfaction Techniques for Agent-Based Reasoning

  • Nicoleta Neagu

Part of the Whitestein Series in Software Agent Technologies book series (WSSAT)

Table of contents

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.


Constraint Satisfaction Constraint satisfaction problems Management Multi agent systems agents artificial intelligence automated reasoning constraint satisfaction problem intelligence modeling problem solving

Authors and affiliations

  • Nicoleta Neagu
    • 1
  1. 1.Whitestein Technologies AGZürich

Bibliographic information