|
Abstract : |
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver such as consistency checks, constraint inference, as well as the search for instantiations. However, off-the-shelf constraint solvers are usually geared towards their typical applications. Since proof planning differs from other applications, we present extensions of constraint solving necessary for its use in proof planning. We think that these extensions can broaden the range applications of constraint solving even beyond proof planning. 1, |
