Improving the Efficiency of Minimal Model Generation by Extracting Branching Lemmas
-
- Hasegawa Ryuzo
- Graduate School of Information Science and Electrical Engineering, Kyushu University
-
- Fujita Hiroshi
- Graduate School of Information Science and Electrical Engineering, Kyushu University
-
- Koshimura Miyuki
- Graduate School of Information Science and Electrical Engineering, Kyushu University
Bibliographic Information
- Other Title
-
- 分岐補題の抽出による極小モデル生成の効率化
- ブンキホ ダイ ノ チュウシュツ ニ ヨル キョクショウ モデル セイセイ ノ コウリツカ
Search this article
Abstract
We present an efficient method for minimal model generation. The method employs branching assumptions and lemmas so as to prune branches that lead to nonminimal models, and to reduce minimality tests on obtained models. Branching lemmas are extracted from a subproof of a disjunct, and work as factorization. This method is applicable to other approaches such as Bry’s constrained search or Niemelä’s groundedness test, and greatlyimpro ves their efficiency. We implemented MM-MGTP based on the method. Experimental results with MM-MGTP show a remarkable speedup compared to MM-SATCHMO.
Journal
-
- Transactions of the Japanese Society for Artificial Intelligence
-
Transactions of the Japanese Society for Artificial Intelligence 16 234-245, 2001
The Japanese Society for Artificial Intelligence
- Tweet
Details 詳細情報について
-
- CRID
- 1390001205108171520
-
- NII Article ID
- 10015769889
-
- NII Book ID
- AA11579226
-
- ISSN
- 13468030
- 13460714
-
- NDL BIB ID
- 5987144
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed