✦ LIBER ✦

Compiling constraint satisfaction problems

✍ Scribed by Rainer Weigel; Boi Faltings

Book ID: 108307076
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 682 KB
Volume: 115
Category: Article
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(99)00077-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized complexity of constraint s

Parameterized complexity of constraint satisfaction problems

✍ Dániel Marx 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 285 KB

Solving set-valued constraint satisfacti

Solving set-valued constraint satisfaction problems

✍ Luc Jaulin 📂 Article 📅 2011 🏛 Springer Vienna 🌐 English ⚖ 403 KB

STCSP — structured temporal constraint s

STCSP — structured temporal constraint satisfaction problems

✍ Mira Balaban; Tzachi Rosen 📂 Article 📅 1999 🏛 Springer Netherlands 🌐 English ⚖ 267 KB

Conditional lexicographic orders in cons

Conditional lexicographic orders in constraint satisfaction problems

✍ Richard J. Wallace; Nic Wilson 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 490 KB

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

Domain permutation reduction for constra

Domain permutation reduction for constraint satisfaction problems

✍ Martin J. Green; David A. Cohen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 304 KB