3 citations · 4 across the 6 of their papers we have counts for
6 papers · 1 filter
Fast Converging Anytime Model Counting
Yong Lai, Kuldeep S. Meel, Roland H. C. Yap
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 model…
CCDD: A Tractable Representation for Model Counting and Uniform Sampling
Yong Lai, Kuldeep S. Meel, Roland H. C. Yap
Knowledge compilation concerns with the compilation of representation languages to target languages supporting a wide range of tractable operations arising from diverse areas of co…
Approximate Model Counting by Partial Knowledge Compilation
Yong Lai
Model counting is the problem of computing the number of satisfying assignments of a given propositional formula. Although exact model counters can be naturally furnished by most o…
Augmenting Ordered Binary Decision Diagrams with Conjunctive Decomposition
Yong Lai, Dayou Liu, Minghao Yin
This paper augments OBDD with conjunctive decomposition to propose a generalization called OBDD[]. By imposing reducedness and the finest -decomposition bounded by…
Ordered {AND, OR}-Decomposition and Binary-Decision Diagram
Yong Lai, Dayou Liu
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 an…
Reduced Ordered Binary Decision Diagram with Implied Literals: A New knowledge Compilation Approach
Yong Lai, Dayou Liu, Shengsheng Wang
Knowledge compilation is an approach to tackle the computational intractability of general reasoning problems. According to this approach, knowledge bases are converted off-line in…