Name
Abstract | ||
|---|---|---|
Logic Machine Architecture (LMA) is a layered implementation of theorem-proving tools. The kernel of formula storage, retrieval, and manipulation primitives (layers 0 and 1) is described elsewhere[2]. The layer described here (layer 2) contains resolution- and equality-based inference rules, subsumption, and demodulation. It is designed to provide all of the tools required to create a theorem-prover with minimal effort. Although LMA is currently implemented in Pascal, an interface to LISP will be included in the original release. This paper includes the design principles and techniques used in layer 2, as well as two simple theorem provers which illustrate the services of layer 2 — one written in LISP and the other in Pascal. |
Year | DOI | Venue |
|---|---|---|
1982 | 10.1007/BFb0000053 | CADE |
Keywords | Field | DocType |
inference mechanisms,logic machine architecture,theorem prover,layer 2,inference rule,theorem proving | Kernel (linear algebra),Demodulation,Programming language,Inference,Computer science,Automated theorem proving,Lisp,Algorithm,Theoretical computer science,Automation,Rule of inference,Mathematical logic | Conference |
ISBN | Citations | PageRank |
3-540-11558-7 | 15 | 7.92 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ewing L. Lusk | 1 | 3080 | 472.23 |
| William McCune | 2 | 15 | 7.92 |
| Ross A. Overbeek | 3 | 760 | 234.40 |