Show simple item record

LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning

dc.contributor.authorBundy, Alan
dc.contributor.authorManning, A.
dc.contributor.authorIreland, A.
dc.date.accessioned2010-12-21T14:57:25Z
dc.date.available2010-12-21T14:57:25Z
dc.date.issued1993
dc.identifier.isbn3-540-56944-8en
dc.identifier.urihttp://portal.acm.org/citation.cfm?id=664139en
dc.identifier.urihttp://hdl.handle.net/1842/4559
dc.description.abstractHeuristic 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.en
dc.language.isoenen
dc.publisherSpringer Verlagen
dc.titleIncreasing the Versatility of Heuristic Based Theorem Proversen
dc.typeConference Paperen
rps.volumeLecture Notes in Artificial Intelligence No. 698en
rps.titleLPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoningen
dc.extent.pageNumbers194-204en
dc.date.updated2010-12-21T14:57:26Z


Files in this item

This item appears in the following Collection(s)

Show simple item record