1. Angiulli, F., Ben-Eliyahu-Zohary, R., Fassetti, F., Palopoli, L.: On the tractability of minimal model computation for some CNF theories. Artif. Intell. 210, 56–77 (2014). doi:
10.1016/j.artint.2014.02.003
2. Ben-Eliyahu-Zohary, R., Angiulli, F., Fassetti, F., Palopoli, L.: Modular construction of minimal models. A full version of this paper, can be obtained from the authors
3. Cadoli, M.: The complexity of model checking for circumscriptive formulae. Inf. Process. Lett. 44(3), 113–118 (1992)
4. Cadoli, M.: On the complexity of model finding for nonmonotonic propositional logics. In: Proceedings of the 4th Italian Conference on Theoretical Computer Science, pp. 125–139. World Scientific Publishing Co., October 1992