Meta-S - Combining Solver Cooperation and Programming Languages

Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative languages. We sketch the main aspects of Meta-S including solver and language integration as well as its strategy definition framework for specifying solver cooperation and language evaluation strategies by means of an example. 1 Motivation Constraint solvers offer problem solving algorithms in an encapsulated way. Many solvers have been designed and implemented, covering several different constraint domains, for example finite domain problems, linear arithmetic or interval arithmetic. However, many real world problems do not fit nicely into one of these categories, but contain constraints of various domains. Writing specialized solvers that can tackle particular multi-domain problems is a time consuming and error prone task. A more promising approach is the integration of existing constraint solvers into...

• Type: Conference
• Year: 2005
• Where: WLP
• Authors: Stephan Frank, Petra Hofstedt, Dirk Reckmann
• Keywords: Constraint Solver Cooperation, Constraint Solvers, Solver Cooperation, WLP 2005