Gesellschaft für Informatik e.V.

Lecture Notes in Informatics

INFORMATIK 2008 Beherrschbare Systeme - dank Informatik Band 2 P-134, 517-522 (2008).

Gesellschaft für Informatik, Bonn


Heinz-Gerd Hegering (ed.), Axel Lehmann (ed.), Hans Jürgen Ohlbach (ed.), Christian Scheideler (ed.)

Copyright © Gesellschaft für Informatik, Bonn


Search design patterns

Henry Müller


In the context of constraint programming search algorithms are normally implemented as monolithic units, which often are complex and error prone, hard to understand and to extend. That holds even for object-oriented state-of-the-art constraint solvers, although the paradigm of object-oriented programming offers various techniques which encourage abstraction, flexibility and code reuse. We apply these techniques on CP search and propose a conception of platform independent, objectoriented search design patterns which state composable search modules. The composition of these modules forms complete search algorithms. Formulating search algorithm with modules has many advantages: They are flexible, reusable and easy to understand. As search modules encapsulate orthogonal abstractions, they categorize search and allow fast and easy search modelling.

Full Text: PDF

Gesellschaft für Informatik, Bonn
ISBN 978-3-88579-228-4

Last changed 04.10.2013 18:18:32