Increasing the versatility of heuristic based theorem provers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 698 LNAI, Issue , 1993, Pages 194-204

  Manning, Alistair ^a,b   Ireland, Andrew ^a   Bundy, Alan ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; LOGIC PROGRAMMING;

FIXED-ORDER; PROOF STRATEGY; SYSTEM DESIGNERS; THEOREM PROVERS; THEOREM PROVING SYSTEMS;

THEOREM PROVING;

EID: 0010190264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56944-8_53     Document Type: Conference Paper

References (7)

1. R.S. Boyer and J.S. Moore. A Computational Logic. Academic Press, 1979. ACM monograph series.
2. A. Bundy. The use of explicit plans to guide inductive proofs. In R. Lusk and R. Ovcrbeek, editors, 9th Conference on Automated Deduction, pages 111-120. Springer-Verlag, 1988. Longer version available from Edinburgh as DAI Research Paper No. 349.
3. R.L. Constable, S.F. Allen, H.M. Bromley, et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, 1986.
4. M.J. Gordon, A.J. Milner, and C.P. Wadsworth. Edinburgh LGF- A mechanised logic of computation, volume 78 of Lecture Notes in Computer Science. Springer Verlag, 1979.
5. J.T. Hesketh. Using Middle-Out Reasoning to Guide Inductive Theorem Proving. Unpublished PhD thesis, University of Edinburgh, 1991.
6. A. Manning. Representing preference in proof plans. Unpublished M.Sc. thesis, Dept. of Artificial Intelligence, Edinburgh, 1992.
7. F. van Harmelen. The CLAM proof planner, user manual and programmer manual: version 1.4. Technical Paper TP-4, DAI, 1989.