6 citations · 8 across the 8 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.AI2019
CoAPI: An Efficient Two-Phase Algorithm Using Core-Guided Over-Approximate Cover for Prime Compilation of Non-Clausal Formulae
Weilin Luo, Hai Wan, Hongzhen Zhong +1
Prime compilation, i.e., the generation of all prime implicates or implicants (primes for short) of formulae, is a prominent fundamental issue for AI. Recently, the prime compilati…
cs.AI2019
Combining Reinforcement Learning and Configuration Checking for Maximum k-plex Problem
Peilin Chen, Hai Wan, Shaowei Cai +2
The Maximum k-plex Problem is an important combinatorial optimization problem with increasingly wide applications. Due to its exponential time complexity, many heuristic methods ha…