Publisher
Springer International Publishing
Reference26 articles.
1. Buchfuhrer, D., Umans, C.: The complexity of boolean formula minimization. J. Comput. Syst. Sci. 77(1), 142–153 (2011)
2. Cadoli, M., Donini, F.M., Liberatore, P., Schaerf, M.: Space efficiency of propositional knowledge representation formalisms. J. Artif. Intell. Res. (JAIR) 13, 1–31 (2000)
3. Coste-Marquis, S., Lang, J., Liberatore, P., Marquis, P.: Expressive power and succinctness of propositional languages for preference representation. In: KR, pp. 203–212 (2004)
4. Darwiche, A.: Decomposable negation normal form. J. ACM 48(4), 608–647 (2001)
5. Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res. (JAIR) 17, 229–264 (2002)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献