Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits

Pierre Bourhis, Laurence Duchien, Jérémie Dusart +3

We are interested in computing $k$ most preferred models of a given d-DNNF circuit $C$, where the preference relation is based on an algebraic structure called a monotone, totally…