Improving the efficiency of minimal model generation by extracting branching lemmas

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)234-245
Number of pages12
JournalTransactions of the Japanese Society for Artificial Intelligence
Volume16
Issue number2
DOIs
Publication statusPublished - Dec 1 2001

Fingerprint

Factorization

All Science Journal Classification (ASJC) codes

  • Software
  • Artificial Intelligence

Cite this

@article{c4463700b6f3417fa897758e731c647a,
title = "Improving the efficiency of minimal model generation by extracting branching lemmas",
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{\"a}'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.",
author = "Ryuzo Hasegawa and Hiroshi Fujita and Miyuki Koshimura",
year = "2001",
month = "12",
day = "1",
doi = "10.1527/tjsai.16.234",
language = "English",
volume = "16",
pages = "234--245",
journal = "Transactions of the Japanese Society for Artificial Intelligence",
issn = "1346-0714",
publisher = "Japanese Society for Artificial Intelligence",
number = "2",

}

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/12/1

Y1 - 2001/12/1

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

VL - 16

SP - 234

EP - 245

JO - Transactions of the Japanese Society for Artificial Intelligence

JF - Transactions of the Japanese Society for Artificial Intelligence

SN - 1346-0714

IS - 2

ER -