Global ETD Search

1	Parallel analytic tableaux systems Johnson, Robert David January 1996 (has links) No description available. 005 Automated theorem proving
2	Exploiting dependencies in search and inference mechanisms Shanahan, Murray Patrick January 1987 (has links) No description available. 510 Theorem proving
3	The use of data-mining for the automatic formation of tactics Duncan, Hazel January 2007 (has links) As functions which further the state of a proof in automated theorem proving, tactics are an important development in automated deduction. This thesis describes a method to tackle the problem of tactic formation. Tactics must currently be developed by hand, which can be a complicated and time-consuming process. A method is presented for the automatic production of useful tactics. The method presented works on the principle that commonly occurring patterns within proof corpora may have some significance and could therefore be exploited to provide novel tactics. These tactics are discovered using a three step process. Firstly a suitable corpus is chosen and processed. One example of a suitable corpus is that of the Isabelle theorem prover. A number of possible abstractions are presented for this corpus. Secondly, machine learning techniques are used to data-mine each corpus and find sequences of commonly occurring proof steps. The specifics of a proof step are defined by the specified abstraction. The formation of these tactics is completed using evolutionary techniques to combine these patterns into compound tactics. These new tactics are applied using a naive prover as well as undergoing manual evalutation. The tactics show favourable results across a selection of tests, justifying the claim that this project provides a novel method of automatically producing tactics which are both viable and useful. 005.3 Tactics ; Theorem Proving
4	Mechanising heterogeneous reasoning in theorem provers Urbas, Matej January 2014 (has links) No description available. 004 Automatic theorem proving
5	Generating pseudo-random theorems for testing theorem provers Darwish, Nevin Mahmoud, 1952- January 1978 (has links) No description available. Automatic theorem proving.
6	Hyperresolution for resolution logics Ghazizadeh, Behrad. January 1999 (has links) Thesis (M. Sc.)--York University, 1999. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 76-77). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ39193. Automatic theorem proving.
7	Generating pseudo-random theorems for testing theorem provers Darwish, Nevin Mahmoud, 1952- January 1978 (has links) No description available. Automatic theorem proving.
8	A novel term rewriting strategy for certain hierarchical AC-algebraic systems Okoli, Ifeyinwa January 1989 (has links) No description available. 510 Theorem proving
9	A unit resolution theorem proving system LeQuesne, Peter Neave January 1972 (has links) A unit resolution theorem proving system is developed and compared with the previous work of C.L. Chang. This thesis includes a description of a particular approach to unit resolution and a description of the resulting program and its effectiveness. / Science, Faculty of / Computer Science, Department of / Graduate Automatic theorem proving.
10	On the completeness of linear strategies in automatic consequence finding Minicozzi, Eliana January 1972 (has links) 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. / Science, Faculty of / Computer Science, Department of / Graduate Automatic theorem proving.

Search results