拡張EBLに基づく問題解決マクロテーブルの獲得

• 山村 雅幸

  東京工業大学総合理工学研究科

• 小林 重信

  東京工業大学総合理工学研究科

書誌事項

タイトル別名

• An Augmented EBL Learner for Acquiring Problem Solving Macrotable

抄録

The augmented EBL is a framework for knowledge refinement based on generalization from examples. It is different from conventional EBL that plural examples are considered simultaneously. It has been formalized on logic program, and relationships between generalization space of plural examples and operationality criteria have been discussed. In this paper, we forcus on a class of problem solving that have serially decomposable subgoals, and propose an augmented EBL learner that acquires a problem solving macrotable from examples. The learning problem is formalized on logic program. A domain theory consists of operator definitions which is the minimal knowledge for problem solving. A solution order is a sequence of generalizations of the goal. A macro table is a logic program, which is ordered reversally to the solution order. Given operator sequences of macros and their row positions in the macro table, it is shown easy to determine the instantiation of macros, that is precondition and conclusion, and the solution order. Thus it is substantial to determine operator sequences and their row positions in order to learn a macro table. We propose an augmented EBL learner that uses membership queries in addition with randomly given positive examples. Membership queries are used through two concepts of a decomposition and a serialization table. An example is decomposed into a composition of macros. The serialization table enumerates all feasible orderings of 2 macros according to results of membership queries against their compositions. The usefulness of the learner is shown by applying to 8-puzzle. The serialization table is shown complete, then the learner acquires correct macro table. The complexity of the learner is polynomial in the size of macro table when there exist no composite macros, that is decomposable into other macros. Current implementation generates exponentially many membership queries of the size of composite macros if they exist. It is a further issue to resolve this difficulty.

収録刊行物

• 人工知能

  人工知能 6 (1), 72-83, 1991-01-01

  一般社団法人 人工知能学会

キーワード

• EBL
• augmented EBL
• knowledge refinement
• learning from examples
• operationality criterion
• logic program
• macrotable
• serially decomposable subgoals
• membership query

詳細情報

• CRID: 1390848647558668544
• NII論文ID: 110002807383
• NII書誌ID: AN10067140
• DOI: 10.11517/jjsai.6.1_72
• ISSN: 24358614
• ISSN: 21882266
• 本文言語コード: ja
• データソース種別:
  • JaLC
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可