Automated reasoning: 33 BASIC research problems
Automated reasoning: 33 BASIC research problems
Automatic Theorem Proving With Renamable and Semantic Resolution
Journal of the ACM (JACM)
SCOTT: Semantically Constrained Otter System Description
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
FINDER: Finite Domain Enumerator - System Description
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
SCOTT: a model-guided theorem prover
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Ordered semantic hyper linking
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
The CADE-20 automated theorem proving competition
AI Communications
TPTP, CASC and the development of a semantically guided theorem prover
AI Communications - CASC
Computational Discovery in Pure Mathematics
Computational Discovery of Scientific Knowledge
The 4th IJCAR Automated Theorem Proving System Competition - CASC-J4
AI Communications
Semantically guiding a first-order theorem prover with a soft model
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
| Hi-index | 0.00 |
This paper reports recent experimental work in the development and refinement of the first order theorem prover SCOTT-5. This is descended from the SCOTT (Semantically Constrained OTTER) prover (see Proc. IJCAI 1993, pp. 109-114) and uses the same combination of a saturation-based theorem prover and a finite domain constraint solver, but the architecture of SCOTT-5 is radically different from that of its ancestor. Here we briefly outline semantic guidance as it occurs in SCOTT-5, and give experimental evidence of an improvement in performance (in terms of efficiency) that we attribute to the guidance strategy.