Go to  Advanced Search

On the completeness of linear strategies in automatic consequence finding

Show full item record

Files in this item

Files Size Format Description   View
UBC_1972_A6_7 M55.pdf 3.066Mb Adobe Portable Document Format   View/Open
 
Title: On the completeness of linear strategies in automatic consequence finding
Author: Minicozzi, Eliana
Degree Master of Science - MSc
Program Computer Science
Copyright Date: 1972
Subject Keywords Automatic theorem proving.
Abstract: The problem of the automatic generation of logical consequences of a set of axioms is examined. The merging subsumption linear strategy has been shown complete with respect to that problem. A generalization of a set of support strategy is given, and the completeness of merging subsumption linear strategy with set of support is proved. The merging-linear-A-ordered strategy and the merging linear-C-ordered strategy have been shown to be incomplete. Relations between unit strategy and input strategy have been examined. A little review of the ‘interesting theorem’ is given.
URI: http://hdl.handle.net/2429/33572
Series/Report no. UBC Retrospective Theses Digitization Project [http://www.library.ubc.ca/archives/retro_theses/]
Scholarly Level: Graduate

This item appears in the following Collection(s)

Show full item record

All items in cIRcle are protected by copyright, with all rights reserved.

UBC Library
1961 East Mall
Vancouver, B.C.
Canada V6T 1Z1
Tel: 604-822-6375
Fax: 604-822-3893