Harald Meyer auf'm Hofe: Finding Regions for Local Repair in Partial Constraint Satisfaction
in:
KI-98: Advances in Artificial Intelligence, 22nd Annual German
Conference on Artificial Intelligence. Springer Verlag, 1998, pages
57-68.
Abstract: Yet, two classes of
algorithms have been used in partial constraint satisfaction: local
search methods and Branch-and-Bound search extended by the classical
constraint-processing techniques like e.g. forward checking and
backmarking. Both classes exhibit characteristic advantages and
drawbacks. This article presents a novel approach for solving partial
constraint satisfaction problems exhaustively that combines advantages
of local search and extended Branch-and-Bound algorithms. This method
relies on repair based search and a generic method for an exhaustive
enumeration of repair steps.
|
Imprint
