Adaptation of declaratively represented methods in proof planning

  • Authors:

  • Xiaorong Huang;Manfred Kerber;Lassaad Cheikhrouhou

  • Affiliations:

  • Techne Knowledge Systems Inc., Toronto, Canada E-mail: xh@techne.ca;School of Computer Science, University of Birmingham, Birmingham B15 2TT, UK E-mail: M.Kerber@cs.bham.ac.uk;Universität des Saarlandes, Fachbereich Informatik, D‐66041 Saarbrücken, Germany E-mail: lassaad@cs.uni‐sb.de

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

The reasoning power of human‐oriented plan‐based reasoning systems is primarily derived from their domain‐specific problem solving knowledge. Such knowledge is, however, intrinsically incomplete. In order to model the human ability of adapting existing methods to new situations we present in this work a declarative approach for representing methods, which can be adapted by so‐called meta‐methods. Since the computational success of this approach relies on the existence of general and strong meta‐methods, we describe several meta‐methods of general interest in detail by presenting the problem solving process of two familiar classes of mathematical problems. These examples should illustrate our philosophy of proof planning as well: besides planning with a pre‐defined repertory of methods, the repertory of methods evolves with experience in that new ones are created by meta‐methods that modify existing ones.