Publisher
Springer International Publishing
Reference13 articles.
1. Bogaerts, B., den Broeck, G.V.: Knowledge compilation of logic programs using approximation fixpoint theory. TPLP 15(4–5), 464–480 (2015)
2. Darwiche, A.: Compiling knowledge into decomposable negation normal form. In: IJCAI 1999, pp. 284–289. Morgan Kaufmann (1999)
3. Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res. 17, 229–264 (2002)
4. Eiter, T., Hecher, M., Kiesel, R.: Treewidth-aware cycle breaking for algebraic answer set counting. In: KR 2021, vol. 18, pp. 269–279 (2021)
5. Fichte, J.K., Gaggl, S.A., Rusovac, D.: Rushing and strolling among answer sets - navigation made easy. In: AAAI 2022 (2022)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献