Abstract
KEIM is a collection of software modules, written in Common Lisp with CLOS, designed to be used in the implementation of automated reasoning systems. KEIM is intended to be used by those who want to build or use deduction systems (such as resolution theorem provers) without having to write the entire framework. KEIM is also suitable for embedding a reasoning component into another Common Lisp program. It offers a range of datatypes implementing a logical language of type theory (higher order logic), in which first order logic can be easily embedded. KEIM's datatypes and algorithms include: types; terms (symbols, applications, abstractions); unification and substitutions; proofs, including resolution and natural deduction styles.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P. Graf: Path Indexing for Term Retrieval. Technical Report MPI-I-92-237, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1992.
X. Huang et al.: Ω-MKRP, A Proof Development Environment. In these proceedings.
D. Nesmith, editor: KEIM-Manual version 1.2. Universität des Saarlandes, Im Stadtwald, Saarbrücken, Germany, 1994.
J. Richts and D. Nesmith: Implementing Simple Theorem Provers in KEIM: Case Studies. To appear as a SEKI Report, Universität des Saarlandes, Im Stadtwald, Saarbrücken, Germany.
G. Steele: Common Lisp, second edition. Digital Press, Boston, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, X. et al. (1994). KEIM: A toolkit for automated deduction. In: Bundy, A. (eds) Automated Deduction — CADE-12. CADE 1994. Lecture Notes in Computer Science, vol 814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58156-1_65
Download citation
DOI: https://doi.org/10.1007/3-540-58156-1_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58156-7
Online ISBN: 978-3-540-48467-7
eBook Packages: Springer Book Archive