1 citations · 2 across the 11 of their papers we have counts for
5 papers · 1 filter
Weighted First-Order Model Counting over Ordered Domains
Jan Tóth, Qipeng Kuang, Kuncheng Zou +4
The Weighted First-Order Model Counting Problem (WFOMC) asks for the weighted sum of models of a first-order logical sentence over a domain. It is a fundamental problem in statisti…
CombEval: A Framework for Evaluating Combinatorial Counting in Large Language Models
Yuxu Zhou, Ondřej Kuželka, Yuyi Wang +2
We present CombEval, a dynamic benchmark for evaluating combinatorial counting in large language models. CombEval represents each problem as a typed Cofola specification over entit…
Solving Combinatorial Counting Problems with Weighted First-Order Model Counting
Yuanhong Wang, Juhua Pu, Yuxu Zhou +2
Combinatorial counting problems pervade artificial intelligence, statistics, and discrete mathematics. Whether the task is enumerating subsets, multisets, permutations, partitions,…
Distributed Renaming with Subquadratic Bits via Scalable Committee Election
Sirui Bai, Xinyu Fu, Yuyi Wang +1
In distributed computing, the renaming problem requires nodes with unique identities from a large namespace to acquire new, distinct identities from a smaller target name…
On Knowledge Compilation For Two-Variable First-Order Logic
Qiaolan Meng, Juhua Pu, Hongting Niu +3
Knowledge compilation transforms logical theories into circuit representations that support efficient reasoning. We study this problem for propositional groundings of FO2, the two-…