Fujipress Home | Search | About FINDER

Paper:
Language: English:

A Speedup Algorithm for Repetition of Hypothetical Reasoning


Haruhiko Kimura*, Tadanobu Misawa**, Koji Abe***, and Yasuhiro Ogoshi****


*Dept. of Information and System Engineering, Kanazawa University
Kakumamachi, Kanazawa 920-1192, Japan
**School of Management, Tokyo University of Science
500 Shimokiyoku, Kuki, Saitama 346-8512, Japan
***Dept. of Information and Computer Science, Kanazawa Institute of Technology
7-1 Ohgigaoka, Nonoichi, Ishikawa 921-8501, Japan
****Faculty of Engineering, Fukui University
3-9-1 Bunkyo, Fukui 910-8507, Japan


Received: January 29, 2003

Accepted: November 29, 2005


Keywords: speedup of hypothetical reasoning, accumulated reasoning time, recursive expression

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.10, No.2 pp. 207-218, 2006

Abstract



This paper presents performance evaluations of a speedup method for hypothetical reasoning to a first-order predicate logic knowledge base in the case when reasoning is executed repeatedly replacing hypothetical knowledge and keeping background knowledge and the goal intact. The proposed method consists of substituting hypotheses for predicate knowledge which has recursive structures, deriving bit patterns of solutions from background knowledge and the goal in advance when all the hypotheses are true, and finding actual solutions from inclusion relation with bit patterns of hypothetical knowledge.
preview Preview (PDF)  full text Full Text (PDF 552KB)

Reference

[Notice]
* "Preview" is the first 2 pages of the article. You don't need the registration.
* To read the PDF file you will then need to download and install the Adobe Reader.
Adobe Reader is free and available for download here:

adobe reader

Terms and Conditions | Privacy Policy | Recruit | Advertising Information | Contact Us