Journal of Automated Reasoning

, Volume 33, Issue 1, pp 51–88

Constraint Solving for Proof Planning

Article

DOI: 10.1007/s10817-004-2725-6

Cite this article as:
Zimmer, J. & Melis, E. J Autom Reasoning (2004) 33: 51. doi:10.1007/s10817-004-2725-6

Abstract

Proof planning is an application of AI planning to theorem proving that employs plan operators that encapsulate mathematical proof techniques. Many proofs require the instantiation of variables; that is, mathematical objects with certain properties have to be constructed. This is particularly difficult for automated theorem provers if the instantiations have to satisfy requirements specific for a mathematical theory, for example, for finite sets or for real numbers, because in this case unification is insufficient for finding a proper instantiation. Often, constraint solving can be employed for this task. We describe a framework for the integration of constraint solving into proof planning that combines proof planners and stand-alone constraint solvers. Proof planning has some peculiar requirements that are not met by any off-the-shelf constraint-solving system. Therefore, we extended an existing propagation-based constraint solver in a generic way. This approach generalizes previous work on tackling the problem. It provides a more principled way and employs existing AI technology.

Keywords

automated reasoning proof plans constraint satisfaction 

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  1. 1.Arbeitsgruppe Siekmann (AGS), Fachbereich Informatik (FB 14)Universität des SaarlandesSaarbrückenGermany
  2. 2.Competence Centre for eLearningGerman Research Center for Artificial Intelligence (DFKI)SaarbrückenGermany

Personalised recommendations