Learn More
In this paper we generalize the notion of method for proof planning. While we adopt the general structure of methods introduced by Alan Bundy, we make an essential advancement in that we strictly separate the declarative knowledge from the procedural knowledge. This change of paradigm not only leads to representations easier to understand , it also enables(More)
In this article we formallydescribe a declarative approach for encoding plan operators in proof planning, the so-called methods. The notion of method evolves from the much studied concept tactic and was rst used by Bundy. While signiicant deductive power has been achieved with the planning approach towards automated deduction, the procedural character of(More)
Mechanised reasoning systems and computer algebra systems have apparently diierent objectives. Their integration is, however, highly desirable, since in many formal proofs both of the two diierent tasks, proving and calculating, have to be performed. In the context of producing reliable proofs, the question how to ensure correctness when integrating a(More)
Begriie ohne Anschauungen sind leer Anschauungen ohne Begriie blind. Abstract Typical examples, that is, examples that are representative for a particular situation or concept, play an important r^ ole in human knowledge representation and reasoning. In real life situations more often than not, instead of a lengthy abstract characterization , a typical(More)
This report presents the main ideas underlying the {mkrp-system, an environment for the development of mathematical proofs. The motivation for the development of this system comes from our extensive experience with traditional rst-order theorem provers and aims to overcome some of their shortcomings. After comparing the beneets and drawbacks of existing(More)