Search Results for author:
Found 7 papers, 2 papers with code
PBCounter: Weighted Model Counting on Pseudo-Boolean Formulas
The experiments on three domains of benchmarks show that PBCounter is superior to the model counters on CNF formulas.
Variants of Tagged Sentential Decision Diagrams
The standard ones minimize the size of sentential decision diagrams (SDDs) while the zero-suppressed trimming rules have the same objective as the standard ones but for zero-suppressed sentential decision diagrams (ZSDDs).
Fast Converging Anytime Model Counting
Model counting is a fundamental problem which has been influential in many applications, from artificial intelligence to formal verification.
CCDD: A Tractable Representation for Model Counting and Uniform Sampling
Knowledge compilation concerns with the compilation of representation languages to target languages supporting a wide range of tractable operations arising from diverse areas of computer science.
Approximate Model Counting by Partial Knowledge Compilation
An unbiased estimate of the model number can be computed via a randomly partial Decision-DNNF formula.
Augmenting Ordered Binary Decision Diagrams with Conjunctive Decomposition
This paper augments OBDD with conjunctive decomposition to propose a generalization called OBDD[$\wedge$].
Ordered {AND, OR}-Decomposition and Binary-Decision Diagram
In the context of knowledge compilation (KC), we study the effect of augmenting Ordered Binary Decision Diagrams (OBDD) with two kinds of decomposition nodes, i. e., AND-vertices and OR-vertices which denote conjunctive and disjunctive decomposition of propositional knowledge bases, respectively.
