ResearchTrend.AI
Exploiting Database Management Systems and Treewidth for Counting
v1v2 (latest)

Exploiting Database Management Systems and Treewidth for Counting

Johannes Fichte
Markus Hecher
Patrick Thier
S. Woltran
ArXiv (abs)PDFHTML

Papers citing "Exploiting Database Management Systems and Treewidth for Counting"

7 / 7 papers shown
Title
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
47
1
0
13 Nov 2023
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
83
25
0
07 Oct 2022
DPER: Dynamic Programming for Exist-Random Stochastic SAT
DPER: Dynamic Programming for Exist-Random Stochastic SAT
Vu Hoang Nguyen Phan
Moshe Y. Vardi
33
1
0
19 May 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
The Model Counting Competition 2020
The Model Counting Competition 2020
Johannes Fichte
Markus Hecher
Florim Hamiti
LRM
58
66
0
02 Dec 2020
DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees
DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees
Jeffrey M. Dudek
Vu Hoang Nguyen Phan
Moshe Y. Vardi
36
21
0
20 Aug 2020
Lower Bounds for QBFs of Bounded Treewidth
Lower Bounds for QBFs of Bounded Treewidth
Johannes Fichte
Markus Hecher
A. Pfandler
57
24
0
02 Oct 2019