Abstract

In previous work, the authors (Hausen-Tropper and Finley, 1988) have developed an extension of classical frame systems using generalized interframe relationships and concepts borrowed from modal logic. Such extended frame systems, termed modal frame systems by the authors, for which a non-deterministic query paradigm was presented, were intended to provide a flexible knowledge representation mechanism that would handle effectively some of the problems arising from exceptions, conflictual information, and defaults in the encoded knowledge. In the present work, an example of a knowledge base using the full richness of the extended frame representation system is presented. The example chosen is taken from an axiomatic development of the existence of real numbers with the intention of representing theorems and their proofs in the extended frames. The intent is to bring out the "deep structure" of the proofs, which might help us to better understand the proof discovery process. Thus, a simple syntactic encoding is not sufficient, rather the choice of a deep representation is sought. With such a representation in hand, the acquisition process should be fairly straight forward. A knowledge base built up in this way will then contain a corpus of knowledge about the given field of mathematics and could be interrogated in order to display the theorems of the system, their proofs, and the interrelationships between the proofs, theorems, axioms, and definitions of the system.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.