Skip navigation
Skip navigation

Proofs as Schemas and Their Heuristic Use

Fuchs, M

Description

Automated theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have many shortcomings. The use of machine-learning techniques such as schemas is acknowledged as promising, but difficult to apply in the area of theorem proving. We propose a simple form of schemas, and to make use of a schema heuristically by integrating it with a search-guiding heuristic. Experiments have demonstrated that the approach allows a theorem...[Show more]

CollectionsANU Research Publications
Date published: 2000
Type: Journal article
URI: http://hdl.handle.net/1885/89815
Source: Journal of Symbolic Computation
DOI: 10.1006/jsco.1999.0349

Download

File Description SizeFormat Image
01_Fuchs_Proofs_as_Schemas_and_Their_2000.pdf354.48 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  27 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator