𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Domain permutation reduction for constraint satisfaction problems

✍ Scribed by Martin J. Green; David A. Cohen

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
304 KB
Volume
172
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Backjump-based backtracking for constrai
Backjump-based backtracking for constraint satisfaction problems
✍ Rina Dechter; Daniel Frost πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 385 KB

The performance of backtracking algorithms for solving finite-domain constraint satisfaction problems can be improved substantially by look-back and look-ahead methods. Look-back techniques extract information by analyzing failing search paths that are terminated by dead-ends. Look-ahead techniques

Using artificial neural networks for con
Using artificial neural networks for constraint satisfaction problem
✍ IliΓ© Popescu πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 471 KB

We address the problem of solving a constraint satisfaction problem (CSP) by treating a constraint logic program (CLP) as a network of constraints. We attempt to show that each computation in a CLP becomes a sequence of linear steps, since the check satisfiability of the system of constraints is app

Boolean constraint satisfaction: complex
Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights
✍ Peter Jonsson πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 125 KB

A boolean constraint satisfaction problem consists of some ΓΏnite set of constraints (i.e., functions from 0=1-vectors to {0; 1}) and an instance of such a problem is a set of constraints applied to speciΓΏed subsets of n boolean variables. The goal is to ΓΏnd an assignment to the variables which satis