1 citations · 2 across the 11 of their papers we have counts for
6 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…
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-…
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…
Model Enumeration of Two-Variable Logic with Quadratic Delay Complexity
Qiaolan Meng, Juhua Pu, Hongting Niu +3
We study the model enumeration problem of the function-free, finite domain fragment of first-order logic with two variables (). Specifically, given an sentence and…
Bridging Weighted First Order Model Counting and Graph Polynomials
Qipeng Kuang, Ondřej Kuželka, Yuanhong Wang +1
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. It can be solved in ti…