Foundations of Constraint Satisfaction

✍ Scribed by Edward Tsang

Year: 1993
Tongue: English
Leaves: 441
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

This textbook examines the constraint satisfaction problem (CSP), which is a general problem in AI applications. It aims to provide a comprehensive introduction to the CSP, covering theoretical, practical and implementation issues. The book discusses formal definitions, CSP solving algorithms and implementation of some of the algorithms on PROLOG. The main objective of this book is to identify the properties of CSPs and introduce algorithms for tackling CSP. Its main feature is the fact that it presents the knowledge in CSP-solving in one volume.

📜 SIMILAR VOLUMES

Foundations of Constraint Satisfaction

📁 Foundations of Constraint Satisfaction

✍ Edward Tsang 📂 Library 📅 1993 🏛 Academic Pr 🌐 English

Foundations of Constraint Satisfaction.

📁 Foundations of Constraint Satisfaction. Computation in Cognitive Science

✍ Edward Tsang (Auth.) 📂 Library 📅 1993 🏛 Elsevier Ltd, Academic Press 🌐 English

Distributed Constraint Satisfaction: Fou

📁 Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems

✍ Makoto Yokoo (auth.) 📂 Library 📅 2001 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p>When multiple agents are in a shared environment, there usually exist con straints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem in which the goal is to find a consistent combination of actions that satisfies these inter-

Distributed Constraint Satisfaction. Fou

📁 Distributed Constraint Satisfaction. Foundations of Cooperation in Multi-Agent Systems

✍ Makoto Yokoo 📂 Library 📅 2001 🏛 Springer 🌐 English

Constraint Satisfaction Problems

📁 Constraint Satisfaction Problems

📂 Library 📅 2013 🏛 Wiley-ISTE 🌐 English

<p>A Constraint Satisfaction Problem (CSP) consists of a set of variables, a domain of values for each variable and a set of constraints. The objective is to assign a value for each variable such that all constraints are satisfied. CSPs continue to receive increased attention because of both their h

The Complexity of Valued Constraint Sati

📁 The Complexity of Valued Constraint Satisfaction Problems

✍ Stanislav Živný (auth.) 📂 Library 📅 2012 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p><p>The topic of this book is the following optimisation problem: given a set of discrete variables and a set of functions, each depending on a subset of the variables, minimise the sum of the functions over all variables. This fundamental research problem has been studied within several different