scientific article; zbMATH DE number 3986666
[For the entire collection see Zbl 0598.00015.] We present four components of a strategy for the implementation of high- performance automated theorem proving systems. These are 1) clause compilation, 2) multiprocessing, 3) database indexing, and 4) clause-set compaction. We describe each of these techniques and show how they can be integrated into a coherent system with significantly higher performance than traditional systems. The strategy described has been implemented, and we present results showing the effects of these techniques on Sam's Lemma, a relatively difficult theorem-proving problem.
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler
- scientific article; zbMATH DE number 1748586 (Why is no real title available?)
- Increasing the efficiency of automated theorem proving
- Refinements to depth-first iterative-deepening search in automatic theorem proving
- Experiments with discrimination-tree indexing and path indexing for term retrieval
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750137)