INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND INFORMATION PROCESSING PROGRAM

PROBLEM TO BE SOLVED: To suppress complexity of a data structure in construction or correction of a knowledge database.SOLUTION: A storage part 201 stores, for each node of a tree structure data, branch conditions, display conditions, basic information, and additional information. A reception part 2...

Full description

Saved in:
Bibliographic Details
Main Authors KOBAYASHI NORIYUKI, OHORI KOTARO, OBATA AKIHIKO
Format Patent
LanguageEnglish
Japanese
Published 31.03.2016
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:PROBLEM TO BE SOLVED: To suppress complexity of a data structure in construction or correction of a knowledge database.SOLUTION: A storage part 201 stores, for each node of a tree structure data, branch conditions, display conditions, basic information, and additional information. A reception part 202 receives input of information. When the information received by the reception part 202 satisfies branch conditions corresponding to any of child nodes of the current node of the tree structure data, a display control part 203 displays basic information corresponding to the child nodes satisfying the branch conditions. When the information received by the reception part 202 satisfies display conditions corresponding to the child nodes satisfying the branch conditions, the display control part 203 displays additional information corresponding to the child nodes satisfying the branch conditions together with the basic information.SELECTED DRAWING: Figure 2 【課題】知識データベースの構築または修正においてデータ構造が複雑になることを抑制すること。【解決手段】記憶部２０１は、木構造データのノードごとに分岐条件、表示条件、基本情報及び追加情報を記憶する。受付部２０２は、情報の入力を受け付ける。表示制御部２０３は、受付部２０２が受け付けた情報が、木構造データの現在ノードの子ノードの何れかに対応する分岐条件を満たす場合、分岐条件を満たす子ノードに対応する基本情報を表示させる。さらに、表示制御部２０３は、受付部２０２が受け付けた情報が、分岐条件を満たす子ノードに対応する表示条件を満たす場合、基本情報と共に、分岐条件を満たす子ノードに対応する追加情報を表示させる。【選択図】図２
Bibliography:Application Number: JP20140166240