Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers
Not on the map. Why?
Abstract (arXiv)
It is known due to the work of Van den Broeck et al [KR, 2014] that weighted first-order model counting (WFOMC) in the two-variable fragment of first-order logic can be solved in time polynomial in the number of domain elements. In this paper we extend this result to the two-variable fragment with counting quantifiers.
Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 5; 2024: 1; 2025: 5; 2026: 3.
16 papers.
Sort:
- 2022Lifted Inference with Linear Order Axiomcited by 13
- 2021Weighted Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formulacited by 8
- 2023Lifted Algorithms for Symmetric Weighted First-Order Model Samplingcited by 6
- 2023Lifted Inference beyond First-Order Logiccited by 5
- 2024Bridging Weighted First Order Model Counting and Graph Polynomialscited by 5
- 2023On Exact Sampling in the Two-Variable Fragment of First-Order Logiccited by 3
- 2025Faster Lifting for Ordered Domains with Predecessor Relationscited by 2
- 2023Weighted First Order Model Counting with Directed Acyclic Graph Axiomscited by 1
- 2023Synthesising Recursive Functions for First-Order Model Counting: Challenges, Progress, and Conjecturescited by 1
- 2025Towards Practical First-Order Model Countingcited by 1
- 2025Polynomial-Time Relational Probabilistic Inference in Open Universescited by 1
- 2025Model Enumeration of Two-Variable Logic with Quadratic Delay Complexitycited by 1
4 more
- 2025Tractable Weighted First-Order Model Counting with Bounded Treewidth Binary Evidencecited by 0
- 2026A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifierscited by 0
- 2026Solving Combinatorial Counting Problems with Weighted First-Order Model Countingcited by 0
- 2026CombEval: A Framework for Evaluating Combinatorial Counting in Large Language Modelscited by 0
- 2026CombEval: A Framework for Evaluating Combinatorial Counting in Large Language Models18 Jun 2026
- 2026Solving Combinatorial Counting Problems with Weighted First-Order Model Counting24 May 2026
- 2026A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers5 May 2026
- 2025Tractable Weighted First-Order Model Counting with Bounded Treewidth Binary Evidence12 Nov 2025
- 2025Faster Lifting for Ordered Domains with Predecessor Relations25 Jul 2025
- 2025Model Enumeration of Two-Variable Logic with Quadratic Delay Complexity26 May 2025
- 2025Polynomial-Time Relational Probabilistic Inference in Open Universes7 May 2025
- 2025Towards Practical First-Order Model Counting17 Feb 2025
- 2024Bridging Weighted First Order Model Counting and Graph Polynomials16 Jul 2024
- 2023Lifted Inference beyond First-Order Logic22 Aug 2023
- 2023Lifted Algorithms for Symmetric Weighted First-Order Model Sampling17 Aug 2023
- 2023Synthesising Recursive Functions for First-Order Model Counting: Challenges, Progress, and Conjectures7 Jun 2023
4 more
- 2023Weighted First Order Model Counting with Directed Acyclic Graph Axioms20 Feb 2023
- 2023On Exact Sampling in the Two-Variable Fragment of First-Order Logic6 Feb 2023
- 2022Lifted Inference with Linear Order Axiom2 Nov 2022
- 2021Weighted Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formula12 Oct 2021
- 2022Lifted Inference with Linear Order Axiomcited by 13
- 2021Weighted Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formulacited by 8
- 2023Lifted Algorithms for Symmetric Weighted First-Order Model Samplingcited by 6
- 2023Lifted Inference beyond First-Order Logiccited by 5
- 2024Bridging Weighted First Order Model Counting and Graph Polynomialscited by 5
- 2023On Exact Sampling in the Two-Variable Fragment of First-Order Logiccited by 3
- 2025Faster Lifting for Ordered Domains with Predecessor Relationscited by 2
- 2023Weighted First Order Model Counting with Directed Acyclic Graph Axiomscited by 1
- 2023Synthesising Recursive Functions for First-Order Model Counting: Challenges, Progress, and Conjecturescited by 1
- 2025Towards Practical First-Order Model Countingcited by 1
- 2025Polynomial-Time Relational Probabilistic Inference in Open Universescited by 1
- 2025Model Enumeration of Two-Variable Logic with Quadratic Delay Complexitycited by 1
12 most cited of 16 All 16 (JSON)
- 2026CombEval: A Framework for Evaluating Combinatorial Counting in Large Language Models18 Jun 2026
- 2026Solving Combinatorial Counting Problems with Weighted First-Order Model Counting24 May 2026
- 2026A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers5 May 2026
- 2025Tractable Weighted First-Order Model Counting with Bounded Treewidth Binary Evidence12 Nov 2025
- 2025Faster Lifting for Ordered Domains with Predecessor Relations25 Jul 2025
- 2025Model Enumeration of Two-Variable Logic with Quadratic Delay Complexity26 May 2025
- 2025Polynomial-Time Relational Probabilistic Inference in Open Universes7 May 2025
- 2025Towards Practical First-Order Model Counting17 Feb 2025
- 2024Bridging Weighted First Order Model Counting and Graph Polynomials16 Jul 2024
- 2023Lifted Inference beyond First-Order Logic22 Aug 2023
- 2023Lifted Algorithms for Symmetric Weighted First-Order Model Sampling17 Aug 2023
- 2023Synthesising Recursive Functions for First-Order Model Counting: Challenges, Progress, and Conjectures7 Jun 2023
12 newest of 16 All 16 (JSON)