39 citations · 102 across the 36 of their papers we have counts for
10 papers · 1 filter
Unary Functions, Automorphisms, and Unlabeled First-Order Model Counting
Ondřej Kuželka
Every fixed first-order sentence determines an enumerative sequence , counting its models on the labeled domain . We study the complexity of th…
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-…
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…
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…
Complexity of Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers: A Bound to Beat
Jan Tóth, Ondřej Kuželka
We study the time complexity of the weighted first-order model counting (WFOMC) over the logical language with two variables and counting quantifiers. The problem is known to be so…
On Discovering Interesting Combinatorial Integer Sequences
Martin Svatoš, Peter Jung, Jan Tóth +2
We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate firs…