6 citations · 6 across the 1 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2002★ 6 cited
Compilation of Propositional Weighted Bases
Adnan Darwiche, Pierre Marquis
In this paper, we investigate the extent to which knowledge compilation can be used to improve inference from propositional weighted bases. We present a general notion of compilati…
cs.AI2000
On the tractable counting of theory models and its application to belief revision and truth maintenance
Adnan Darwiche
We introduced decomposable negation normal form (DNNF) recently as a tractable form of propositional theories, and provided a number of powerful logical operations that can be perf…