9 papers
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…
Verifiable Counterfactual Supervision for Process Reward Models
Yinghui Chi, Yuanhong Wang
Process reward models (PRMs) require supervision that identifies not only whether a reasoning trajectory is correct, but also where the reasoning process first becomes unsupported…
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…
A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers
Shixin Sun, Astrid Klipfel, Ondřej Kuželka +2
Weighted first-order model counting (WFOMC) is a central task in lifted probabilistic inference: It asks for the weighted sum of all models of a first-order sentence over a finite…
Tractable Weighted First-Order Model Counting with Bounded Treewidth Binary Evidence
Václav Kůla, Qipeng Kuang, Yuyi Wang +2
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…
Weighted First Order Model Counting for Two-variable Logic with Axioms on Two Relations
Qipeng Kuang, Václav Kůla, Ondřej Kuželka +2
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. The boundary between f…