TY - JOUR
T1 - Improving the efficiency of minimal model generation by extracting branching lemmas
AU - Hasegawa, Ryuzo
AU - Fujita, Hiroshi
AU - Koshimura, Miyuki
PY - 2001
Y1 - 2001
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=18544361882&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=18544361882&partnerID=8YFLogxK
U2 - 10.1527/tjsai.16.234
DO - 10.1527/tjsai.16.234
M3 - Article
AN - SCOPUS:18544361882
SN - 1346-0714
VL - 16
SP - 234
EP - 245
JO - Transactions of the Japanese Society for Artificial Intelligence
JF - Transactions of the Japanese Society for Artificial Intelligence
IS - 2
ER -