The power of literal equivalence in model counting
The past two decades have seen the significant improvements of the scalability of practical
model counters, which have been quite influential in many applications from artificial …
model counters, which have been quite influential in many applications from artificial …
Fast converging anytime model counting
Abstract Model counting is a fundamental problem which has been influential in many
applications, from artificial intelligence to formal verification. Due to the intrinsic hardness of …
applications, from artificial intelligence to formal verification. Due to the intrinsic hardness of …
[PDF][PDF] Knowledge compilation for incremental and checkable stochastic Boolean satisfiability
Abstract Knowledge compilation has proven effective in (weighted) model counting,
uniquely supporting incrementality and checkability. For incrementality, compiling an input …
uniquely supporting incrementality and checkability. For incrementality, compiling an input …
DiagDO: an efficient model based diagnosis approach with multiple observations
H Zhou, D Ouyang, X Tian, L Zhang - Frontiers of Computer Science, 2023 - Springer
Abstract Model-based diagnosis (MBD) with multiple observations shows its significance in
identifying fault location. The existing approaches for MBD with multiple observations use …
identifying fault location. The existing approaches for MBD with multiple observations use …
A Knowledge Compilation Map for Quantum Information
Quantum computing is finding promising applications in optimization, machine learning and
physics, leading to the development of various models for representing quantum …
physics, leading to the development of various models for representing quantum …
Engineering an Efficient Preprocessor for Model Counting
Given a formula F, the problem of model counting is to compute the number of solutions
(also known as models) of F. Over the past decade, model counting has emerged as key …
(also known as models) of F. Over the past decade, model counting has emerged as key …
[PDF][PDF] Inc: A scalable incremental weighted sampler
The fundamental problem of weighted sampling involves sampling of satisfying assignments
of Boolean formulas, which specify sampling sets, and according to distributions defined by …
of Boolean formulas, which specify sampling sets, and according to distributions defined by …
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 …
languages supporting a wide range of tractable operations arising from diverse areas of …
INC: A Scalable Incremental Weighted Sampler
The fundamental problem of weighted sampling involves sampling of satisfying assignments
of Boolean formulas, which specify sampling sets, and according to distributions defined by …
of Boolean formulas, which specify sampling sets, and according to distributions defined by …
On complexity of restricted fragments of Decision DNNF
Decision DNNF (aka $\wedge_d $-FBDD) is an important special case of Decomposable
Negation Normal Form (DNNF). Decision DNNF admits FPT sized representation of CNFs of …
Negation Normal Form (DNNF). Decision DNNF admits FPT sized representation of CNFs of …