Presentation 1996/11/2
Effect of preprocessing in Top-down theorem prover
Mutsuhiro YAMASHITA, Kouji IWANUMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Top-down theorem provers have the general advantage that it search the space which have a relation with goals and disadvantage that during the search the same goals have to be proven over and over again. In this paper, we generate unit clauses by doing inline expansion in preprocessing phase and make the total size of search space smaller in proof phase. we incorporate them in Top-down theorem prover and compare our results used the unit clauses, used them as lemma and used them for the semi-optical orders of goals.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) PTTP / Depth-first iterative-deepening / model elimination / lemma / inline expansion
Paper # AI96-28
Date of Issue

Conference Information
Committee AI
Conference Date 1996/11/2(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Effect of preprocessing in Top-down theorem prover
Sub Title (in English)
Keyword(1) PTTP
Keyword(2) Depth-first iterative-deepening
Keyword(3) model elimination
Keyword(4) lemma
Keyword(5) inline expansion
1st Author's Name Mutsuhiro YAMASHITA
1st Author's Affiliation Department of Electrical Engineering and Computer Science, Faculty of Engineering, Yamanashi University()
2nd Author's Name Kouji IWANUMA
2nd Author's Affiliation Department of Electrical Engineering and Computer Science, Faculty of Engineering, Yamanashi University
Date 1996/11/2
Paper # AI96-28
Volume (vol) vol.96
Number (no) 346
Page pp.pp.-
#Pages 7
Date of Issue