Partial Constraint Satisfaction (1992)
Cached
Download Links
- [4c.ucc.ie]
- [www.sci.unich.it]
- [www.dmi.unipg.it]
- DBLP
Other Repositories/Bibliography
| Citations: | 469 - 21 self |
BibTeX
@MISC{Freuder92partialconstraint,
author = {Eugene C. Freuder and Richard J. Wallace},
title = {Partial Constraint Satisfaction},
year = {1992}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem, in particular by satisfying a maximal number of constraints. Standard backtracking and local consistency techniques for solving constraint satisfaction problems can be adapted to cope with, and take advantage of, the differences between partial and complete constraint satisfaction. Extensive experimentation on maximal satisfaction problems illuminates the relative and absolute effectiveness of these methods. A general model of partial constraint satisfaction is proposed. 1 Introduction Constraint satisfaction involves finding values for problem variables subject to constraints on acceptable combinations of values. Constraint satisfaction has wide application in artificial intelligence, in areas ranging from temporal r...
Keyphrases
partial constraint satisfaction constraint satisfaction problem absolute effectiveness constraint satisfaction problem variable extensive experimentation wide application maximal satisfaction problem local consistency technique complete constraint satisfaction standard backtracking introduction constraint satisfaction maximal number general model acceptable combination artificial intelligence
