@inproceedings{677773b9aba14c6596acf9a0b20fc3a2,
title = "Effcient minimal model generation using branching lemmas",
abstract = "An effcient method for minimal model generation is presented. 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. This method is applicable to other approaches such as Bry's complement splitting and constrained search or Niemel{\"a}'s groundedness test, and greatly improves their effciency.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 = "2000",
doi = "10.1007/10721959_15",
language = "English",
series = "Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)",
publisher = "Springer Verlag",
pages = "184--199",
editor = "David McAllester",
booktitle = "Automated Deduction - CADE-17 - 17th International Conference on Automated Deduction, Proceedings",
address = "Germany",
note = "17th International Conference on Automated Deduction, CADE 2000 ; Conference date: 17-06-2000 Through 20-06-2000",
}