Publication details

Saarland University Computer Science

Extensions of Constraint Solving for Proof Planning

Erica Melis, Jürgen Zimmer, Tobias Müller

Proceedings of the 14th European Conference on Artificial Intelligence, pp. 229--233, IOS Press, August 2000

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 need to be extended in order to be be integrated appropriately: In particular, for correctness, the context of constraints and Eigenvariable-conditions have to be taken into account. Moreover, symbolic and numeric constraint inference are combined. This paper discusses the extensions to constraint solving for proof planning, namely the combination of symbolic and numeric inference, first-class constraints, and context trees. We also describe the implementation of these extensions in the constraint solver $mathcalcoSIE$.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy