3 citations · 3 across the 3 of their papers we have counts for
4 papers
Representation Learning for Classical Planning from Partially Observed Traces
Zhanhao Xiao, Hai Wan, Hankui Hankz Zhuo +2
Specifying a complete domain model is time-consuming, which has been a bottleneck of AI planning technique application in many real-world scenarios. Most classical domain-model lea…
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…
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…
Query Answering with Inconsistent Existential Rules under Stable Model Semantics
Hai Wan, Heng Zhang, Peng Xiao +2
Traditional inconsistency-tolerent query answering in ontology-based data access relies on selecting maximal components of an ABox/database which are consistent with the ontology.…