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.
