Combining Finite Model Generation with Theorem Proving
- 142 Downloads
This paper is about automatic searching for proofs, automatic searching for models and the potentially fruitful ways in which these traditionally separate aspects of reasoning may be made to interact. It takes its starting point in research reported in 1993 (Slaney, SCOTT: A Semantically Guided Theorem Prover, Proc. 13th IJCAI) on a system which combines a high performance first order theorem prover with a program generating small models of first order theories. The main theorem is an incompleteness result for a certain range of problems to which this combined system has been successfully applied. While the result may not be unexpected, the proof is worth examining and it is important to reflect on its relationship to the research program in combining methods.
KeywordsTheorem Prove Automate Reasoning Proof Strategy Automate Deduction Proof Search
Unable to display preview. Download preview PDF.
- R. Hasegawa, M. Koshimura & H. Fujita, MGTP: A Parallel Theorem Prover Based on Lazy Model Generation, Proceedings of 11th International Conference on Automated Deduction (1992), 776–780.Google Scholar
- W. McCune, OTTER 2.0 Users Guide, Argonne National Laboratory, 1990.Google Scholar
- W. McCune & L. Wos, Experiments in automated deduction with condensed detachment, Proceedings of 11th International Conference on Automated Deduction (1992), 209–223.Google Scholar
- R.K. Meyer & M.W. Bunder, Condensed detachment and combinators, Technical report TR-ARP-8/88, Automated Reasoning Project, Australian National University, 1988.Google Scholar
- R.K. Meyer, M.W. Bunder & L. Powers, Implementing the fool’s model of combinatory logic, Journal of Automated Reasoning 7 (1991).Google Scholar
- J. Schumann, SiCoTHEO: Simple Competitive parallel Theorem Provers based on SETHE0, Typescript, Institut für Informatik, Technische Universität München, 1995.Google Scholar
- J. Slaney, SCOTT: A model-guided theorem prover, Proceedings of 13th International Joint Conference on Artificial Intelligence (1993), 109–114.Google Scholar
- J. Slaney, FINDER: Finite Domain Enumerator (system description), Proceedings of 12th International Conference on Automated Deduction (1994), 764–768.Google Scholar
- J. Slaney, E. Lusk & W. McCune, SCOTT:Semantically Constrained OTTER (system description)Proceedings of 12th International Conference on Automated Deduction (1994), 764–768.Google Scholar