1. Bienvenu, M.: Prime implicates and prime implicants: From propositional to modal logic. J. Artif. Intell. Res. (JAIR) 36, 71–128 (2009)
2. Bienvenu, M.: Consequence Finding in Modal Logic. PhD Thesis, Universit Paul Sabatier (May 7, 2009)
3. Cook, S.A.: The complexity of theorem-proving procedures. In: Proc. 3rd ACM Symp. on the Theory of Computing, pp. 151–158. ACM Press (1971)
4. Cadoli, M., Donini, F.M.: A survey on knowledge compilation. AI Communications-The European Journal for Articial Intelligence 10, 137–150 (1998)
5. Coudert, O., Madre, J.: Implicit and incremental computation of primes and essential primes of boolean functions. In: Proceedings of the 29th ACM/IEEE Design Automation Conference, pp. 36–39. IEEE Computer Society Press (1991)