@inproceedings{58d78d5d432b45bea534c40acae13ace,
title = "Partial constraint satisfaction",
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.",
author = "Freuder, \{Eugene C.\} and Wallace, \{Richard J.\}",
note = "Publisher Copyright: {\textcopyright} 1996, Springer Verlag. All rights reserved.; Workshop on Over-Constrained Systems, held as part of 1st International Conference on Principles and Practice of Constraint Programming, CP 1995 ; Conference date: 18-09-1995 Through 18-09-1995",
year = "1996",
doi = "10.1007/3-540-61479-6\_18",
language = "English",
isbn = "3540614796",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "63--110",
editor = "Michael Jampel and Eugene Freuder and Michael Maher",
booktitle = "Over-Constrained Systems",
address = "Germany",
}