Edinburgh Research Explorer

Increasing the Versatility of Heuristic Based Theorem Provers

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

Related Edinburgh Organisations

Open Access permissions

Open

Original languageEnglish
Title of host publicationLPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
PublisherSpringer-Verlag GmbH
VolumeLecture Notes in Artificial Intelligence No. 698
ISBN (Print)3-540-56944-8
StatePublished - 1993

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.

Download statistics

No data available

ID: 403067