Abstract: | This paper addresses analogy-driven automated theorem proving. More precisely, we consider analogy as a control strategy in proof planning and employ a source proof-plan to guide the search for a proof-plan of the target problem. The approach presented employs restructuring and reformulations. Reformulations go beyond symbol mappings and may encode certain re-representations. This is in accordance with the well known fact that appropriate representation which brings out the similarity of two problems, that is, finding the right concepts and the right level of abstraction. Several realistic math examples were successfully processed by our analogy-driven proof-plan construction. one of these examples is discussed here.
|