ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2012.01323
  4. Cited By
The Model Counting Competition 2020

The Model Counting Competition 2020

2 December 2020
Johannes Fichte
Markus Hecher
Florim Hamiti
    LRM
ArXiv (abs)PDFHTML

Papers citing "The Model Counting Competition 2020"

23 / 23 papers shown
Title
Pseudo-Boolean d-DNNF Compilation for Expressive Feature Modeling Constructs
Pseudo-Boolean d-DNNF Compilation for Expressive Feature Modeling Constructs
Chico Sundermann
Stefan Vill
Elias Kuiter
S. Krieter
Thomas Thüm
Matthias Tichy
21
0
0
09 May 2025
Solving Satisfiability Modulo Counting Exactly with Probabilistic Circuits
Solving Satisfiability Modulo Counting Exactly with Probabilistic Circuits
Jinzhao Li
Nan Jiang
Yexiang Xue
65
0
0
02 Mar 2025
The Gradient of Algebraic Model Counting
The Gradient of Algebraic Model Counting
Jaron Maene
Luc de Raedt
63
0
0
25 Feb 2025
Techniques for Measuring the Inferential Strength of Forgetting Policies
Techniques for Measuring the Inferential Strength of Forgetting Policies
Patrick Doherty
A. Szałas
120
1
0
21 Feb 2025
Model Counting in the Wild
Model Counting in the Wild
Arijit Shaw
Kuldeep S. Meel
37
0
0
13 Aug 2024
Quantum Algorithms for Weighted Constrained Sampling and Weighted Model
  Counting
Quantum Algorithms for Weighted Constrained Sampling and Weighted Model Counting
Fabrizio Riguzzi
44
1
0
29 Jun 2024
On the Hardness of Probabilistic Neurosymbolic Learning
On the Hardness of Probabilistic Neurosymbolic Learning
Jaron Maene
Vincent Derkinderen
Luc de Raedt
86
4
0
06 Jun 2024
Extended Version of: On the Structural Hardness of Answer Set
  Programming: Can Structure Efficiently Confine the Power of Disjunctions?
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
Markus Hecher
Rafael Kiesel
35
0
0
05 Feb 2024
IASCAR: Incremental Answer Set Counting by Anytime Refinement
IASCAR: Incremental Answer Set Counting by Anytime Refinement
Johannes Fichte
S. A. Gaggl
Markus Hecher
Dominik Rusovac
45
1
0
13 Nov 2023
Solving Projected Model Counting by Utilizing Treewidth and its Limits
Solving Projected Model Counting by Utilizing Treewidth and its Limits
Johannes Fichte
Markus Hecher
Michael Morak
Patrick Thier
S. Woltran
104
8
0
30 May 2023
Rounding Meets Approximate Model Counting
Rounding Meets Approximate Model Counting
Jiong Yang
Kuldeep S. Meel
46
7
0
16 May 2023
Generation and Prediction of Difficult Model Counting Instances
Generation and Prediction of Difficult Model Counting Instances
Guillaume Escamocher
Barry O'Sullivan
LRM
21
2
0
06 Dec 2022
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder
  than SAT after All?
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?
Markus Hecher
68
25
0
07 Oct 2022
Advanced Tools and Methods for Treewidth-Based Problem Solving --
  Extended Abstract
Advanced Tools and Methods for Treewidth-Based Problem Solving -- Extended Abstract
Markus Hecher
9
1
0
24 Aug 2022
A Quantitative Symbolic Approach to Individual Human Reasoning
A Quantitative Symbolic Approach to Individual Human Reasoning
Emmanuelle-Anna Dietz
Johannes Fichte
Florim Hamiti
LRM
21
4
0
10 May 2022
DPMS: An ADD-Based Symbolic Approach for Generalized MaxSAT Solving
DPMS: An ADD-Based Symbolic Approach for Generalized MaxSAT Solving
Anastasios Kyrillidis
Moshe Y. Vardi
Zhiwei Zhang
30
3
0
08 May 2022
Rushing and Strolling among Answer Sets -- Navigation Made Easy
Rushing and Strolling among Answer Sets -- Navigation Made Easy
Johannes Fichte
S. A. Gaggl
Dominik Rusovac
24
14
0
14 Dec 2021
NeuroBack: Improving CDCL SAT Solving using Graph Neural Networks
NeuroBack: Improving CDCL SAT Solving using Graph Neural Networks
Wenxi Wang
Yang Hu
Mohit Tiwari
S. Khurshid
K. McMillan
Risto Miikkulainen
GNNNAI
72
8
0
26 Oct 2021
Projected Model Counting: Beyond Independent Support
Projected Model Counting: Beyond Independent Support
Jiong Yang
Supratik Chakraborty
Kuldeep S. Meel
45
4
0
18 Oct 2021
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic
  Programs
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
Viktor Besin
Markus Hecher
S. Woltran
41
4
0
06 Aug 2021
Partition Function Estimation: A Quantitative Study
Partition Function Estimation: A Quantitative Study
Durgesh Kumar Agrawal
Yash Pote
Kuldeep S. Meel
73
11
0
24 May 2021
Exploiting Database Management Systems and Treewidth for Counting
Exploiting Database Management Systems and Treewidth for Counting
Johannes Fichte
Markus Hecher
Patrick Thier
S. Woltran
45
24
0
13 Jan 2020
Counting Complexity for Reasoning in Abstract Argumentation
Counting Complexity for Reasoning in Abstract Argumentation
Johannes Fichte
Markus Hecher
Arne Meier
37
27
0
28 Nov 2018
1