Solution Strategies for Multi-domain Constraint Logic Programs

We integrate a logic programming language into Meta-S, a flexible and extendable constraint solver cooperation system, by treating resolution as constraint solver. This new approach easily yields a CLP language with support for solver cooperation. Applying the strategy definition framework of Meta-S we define classical search strategies and more sophisticated ones, that allow an efficient evaluation of multi-domain constraint logic programs.

• Type: Conference
• Year: 2006
• Where: ERSHOV
• Authors: Stephan Frank, Petra Hofstedt, Peter Pepper, Dirk Reckmann
• Keywords: Constraint Solver, Constraint Solver Cooperation, ERSHOV 2006, Solver Cooperation, Theoretical Computer Science