Title:
【発明の名称】多階層化探索処理装置
Document Type and Number:
Japanese Patent JP2571229
Kind Code:
B2
Abstract:
PURPOSE:To decrease a searching quantity and to shorten a searching time by hierarchizing a concept level and executing early branch trimming at a high-order hierarchy. CONSTITUTION:A branch developing part 12 develops the branch of a searching tree in the highest-order searching plane, that is, forms a node to be a searching object, and the information is stored in an individual stack 14. By setting the information to activate a tree searching continuation deciding part 13 to a system stack 15, the part 13 is activated through an inference engine 11, a constraint concerning node information stored into the individual stack 14 are checked, the node inapplicable to the constraint is branch-trimmed, and the node applicable to the constraint is adopted. Thus, the searching time can be shortened.
More Like This:
| WO/2018/076635 | LANGUAGE TEXT LOADING METHOD AND DEVICE |
| JP6099604 | An information processor, the control method, and a program |
| WO/2010/064136 | ANY-TO-ANY SYSTEM FOR DOING COMPUTING |
Inventors:
NAKAJIMA TOSHA
Application Number:
JP16317187A
Publication Date:
January 16, 1997
Filing Date:
June 30, 1987
Export Citation:
Assignee:
FUJITSU LTD
International Classes:
G06F9/44; G06F17/30; G06N5/04; (IPC1-7): G06F17/30
Other References:
白井・辻井著「岩波講座 情報科学−２２ 人工知能」（第２刷）（１９８４）Ｐ．１１３−１１８
Attorney, Agent or Firm:
Yoshiyoshi Ogasawara (2 outside)