Please use this identifier to cite or link to this item:

Automated reasoning and machine learning

File Description SizeFormat 
uhm_phd_9629830_uh.pdfVersion for UH users3.4 MBAdobe PDFView/Open
uhm_phd_9629830_r.pdfVersion for non-UH users. Copying/Printing is not permitted3.45 MBAdobe PDFView/Open

Item Summary

Title: Automated reasoning and machine learning
Authors: Huang, Guoxiang
Keywords: Automatic theorem proving
Logic, Symbolic and mathematical
Artificial intelligence
Issue Date: 1996
Abstract: This dissertation introduces new theorem-proving strategies and uses these strategies to solve a wide variety of difficult problems requiring logical reasoning. It also shows how to use theorem-proving to solve the problem of learning mathematical concepts. Our first algorithm constructs formulas called Craig interpolants from the refutation proofs generated by contemporary theorem-provers using binary resolution, paramodulation, and factoring. This algorithm can construct the formulas needed to learn concepts expressible in the full first-order logic from examples of the concept. It can also find sentences which distinguish pairs of nonisomorphic finite structures. We then apply case analysis to solve hard problems such as the zebra problem, the pigeonhole problem, and the stable marriage problem. The case analysis technique we use is the first to be fully compatible with resolution and rewriting and powerful enough to solve these problems. Our primary new theorem-proving strategies generate subgoals and efficient sets of rules. We show how to divide problems into smaller parts with intermediate goals by reversing logical implications. We solve these subdivided parts by discovering efficient subsets of rules or by generating efficient new rules. We apply these and other new search strategies to solve difficult problems such as the 15-puzzle, central solitaire, TopSpin, Rubik's cube, and masterball. Our strategies apply universally to all such problems and can solve them quite efficiently: the 15-puzzle, Rubik's cube and masterball can all be done in 300 seconds. Finally we apply our search strategies to solve real-world problems such as sorting, solving equations and inverting nonsingular matrices.
Description: Thesis (Ph. D.)--University of Hawaii at Manoa, 1996.
Includes bibliographical references (leaves 140-144).
x, 144 leaves, bound ill. 29 cm
Rights: All UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.
Appears in Collections:Ph.D. - Mathematics
Ph.D. Dissertations- Mathematics Department

Please contact if you need this content in an alternative format.

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