44 citations · 138 across the 18 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
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.AI2020
Oblivious and Semi-Oblivious Boundedness for Existential Rules
Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier +3
We study the notion of boundedness in the context of positive existential rules, that is, whether there exists an upper bound to the depth of the chase procedure, that is independe…