Increasing the Versatility of Heuristic Based Theorem Provers

A. Manning, A. Ireland, Alan Bundy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Heuristic based theorem proving systems typically impose a fixed ordering on the strategies which they embody. The ordering reflects the general experience of the system designer. As a consequence, there will exist a variety of specific instances where the fixed ordering breaks down. We present an approach liberates such systems by introducing a more versatile framework for organising proof strategies.
Original languageEnglish
Title of host publicationLPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
PublisherSpringer
VolumeLecture Notes in Artificial Intelligence No. 698
ISBN (Print)3-540-56944-8
Publication statusPublished - 1993

Fingerprint

Dive into the research topics of 'Increasing the Versatility of Heuristic Based Theorem Provers'. Together they form a unique fingerprint.

Cite this