An upper bound on computing all X-minimal models

The problem of computing X-minimal models, that is, models minimal with respect to a subset X of all the atoms in a theory, is relevant for many tasks in Artificial Intelligence. Unfortunately, the problem is NP-hard. In this paper we present a non-trivial upper bound for the task of computing all X-minimal models: we show that all the X-minimal models of a propositional theory can be found in time time-ord-mod()+O(#DMinModX()n, where time-ord-mod() is the time it takes to find all the models of in a particular order, #DMinModX() is the number of different X-minimal models of T, and |X|=n.