Demo Data from EDBT 2026 / reviewers in the wild / expert
Wanqian Luo
dblp:353/7805
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0003-2638-1382ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 100% | |
| Artificial intelligence
1 paper |
Graph learning · 50% Generative modeling · 50% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning
graph generation |
0.7 | 1 | 2023 | HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline · KDD 2023 |
Machine learning › Generative modeling › diffusion model › controllable generation
structure-aware generation |
0.7 | 1 | 2023 | HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline · KDD 2023 |
Automated reasoning and model checking › satisfiability › SAT solving
SAT instance generation |
0.7 | 1 | 2023 | HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline · KDD 2023 |
Automated reasoning and model checking › satisfiability
SAT solving |
0.7 | 1 | 2023 | HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline · KDD 2023 |
Automated reasoning and model checking › satisfiability
computational complexity of satisfiability |
0.2 | 1 | 2023 | HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline · KDD 2023 |
Methods — techniques the papers use, named apart from their topics
neural split-merge · 1.3graph neural network · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware BaselineabstractIndustrial SAT formula generation is a critical yet challenging task. Existing SAT generation approaches can hardly simultaneously capture the global structural properties and maintain plausible computational hardness. We first present an in-depth analysis for the limitation of previous learning methods in reproducing the computational hardness of original instances, which may stem from the inherent homogeneity in their adopted split-merge procedure. On top of the observations that industrial formulae exhibit clear community structure and oversplit substructures lead to the difficulty in semantic formation of logical structures, we propose HardSATGEN, which introduces a fine-grained control mechanism to the neural split-merge paradigm for SAT formula generation to better recover the structural and computational properties of the industrial benchmarks. Experiments including evaluations on private and practical corporate testbed show the superiority of HardSATGEN being the only method to successfully augments formulae maintaining similar computational hardness and capturing the global structural properties simultaneously. Compared to the best previous methods, the average performance gains achieve 38.5% in structural statistics, 88.4% in computational metrics, and over 140.7% in the effectiveness of guiding solver tuning by our generated instances. Source code is available at https://github.com/Thinklab-SJTU/HardSATGEN. Yang Li 0197, Xijun Li, Wanqian Luo, Junhua Huang, Hui-Ling Zhen, Mingxuan Yuan, Junchi Yan |
KDD | 5 |