6 citations · 6 across the 1 of their papers we have counts for
2 papers
cs.AI2022
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits
Pierre Bourhis, Laurence Duchien, Jérémie Dusart +3
We are interested in computing most preferred models of a given d-DNNF circuit , where the preference relation is based on an algebraic structure called a monotone, totally…
cs.AI2021★ 6 cited
Design and Results of ICCMA 2021
Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly +1
Since 2015, the International Competition on Computational Models of Argumentation (ICCMA) provides a systematic comparison of the different algorithms for solving some classical r…