no code implementations • 26 Dec 2023 • Yong Lai, Zhenghang Xu, Minghao Yin
The experiments on three domains of benchmarks show that PBCounter is superior to the model counters on CNF formulas.
no code implementations • 16 Nov 2023 • Deyuan Zhong, Mingwei Zhang, Quanlong Guan, Liangda Fang, Zhaorong Lai, Yong Lai
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).
1 code implementation • 19 Dec 2022 • 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.
1 code implementation • 21 Feb 2022 • 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 computer science.
no code implementations • 18 May 2018 • Yong Lai
An unbiased estimate of the model number can be computed via a randomly partial Decision-DNNF formula.
no code implementations • 24 Oct 2014 • Yong Lai, Dayou Liu, Minghao Yin
This paper augments OBDD with conjunctive decomposition to propose a generalization called OBDD[$\wedge$].
no code implementations • 14 Aug 2012 • 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 and OR-vertices which denote conjunctive and disjunctive decomposition of propositional knowledge bases, respectively.