4 papers · 1 filter
A Parallel Approach to Counting Exact Covers Based on Decomposability Property
Liangda Fang, Yaohui Luo, Delong Li +2
The exact cover problem is a classical NP-hard problem with broad applications in the area of AI. Algorithm DXZ is a method to count exact covers representing by zero-suppressed bi…
An Exhaustive DPLL Approach to Model Counting over Integer Linear Constraints with Simplification Techniques
Mingwei Zhang, Zhenhao Gu, Liangda Fang +4
Linear constraints are one of the most fundamental constraints in fields such as computer science, operations research and optimization. Many applications reduce to the task of mod…
Variants of Tagged Sentential Decision Diagrams
Deyuan Zhong, Mingwei Zhang, Quanlong Guan +3
A recently proposed canonical form of Boolean functions, namely tagged sentential decision diagrams (TSDDs), exploits both the standard and zero-suppressed trimming rules. The stan…
An Investigation of Darwiche and Pearl's Postulates for Iterated Belief Update
Quanlong Guan, Tong Zhu, Liangda Fang +3
Belief revision and update, two significant types of belief change, both focus on how an agent modify her beliefs in presence of new information. The most striking difference betwe…