Qipeng Kuang — accepted AI-conference papers

2026

Tractable Weighted First-Order Model Counting with Bounded Treewidth Binary Evidence

Václav Kůla, Qipeng Kuang, Yuyi Wang, Yuanhong Wang, Ondřej Kuželka

AAAI 2026technical

The Weighted First-Order Model Counting Problem (WFOMC) asks to compute the weighted sum of models of a given first-order logic sentence over a given domain. Conditioning WFOMC on evidence—fixing the truth values of a set of ground literals—has been shown impossible in time polynomial in the domain

Cited by 0 Source ↗PDF ↗Scholar ↗

2024

Efficient Streaming Algorithms for Graphlet Sampling

Yann Bourreau, Marco Bressan, T-H. Hubert Chan, Qipeng Kuang, Mauro Sozio

NeurIPS 2024poster

Given a graph $G$ and a positive integer $k$, the Graphlet Sampling problem asks to sample a connected induced $k$-vertex subgraph of $G$ uniformly at random. Graphlet sampling enhances machine learning applications by transforming graph structures into feature vectors for tasks such as graph classi…

Cited by 0 Source ↗PDF ↗Scholar ↗