| Publication | Date of Publication | Type |
|---|
| Structure-aware lower bounds and broadening the horizon of tractability for QBF | 2026-02-27 | Paper |
| The relative strength of \#SAT proof systems | 2026-02-03 | Paper |
| ETH lower bounds for \(n\)-queens: time waits for nobody | 2026-01-13 | Paper |
IASCAR: incremental answer set counting by anytime refinement
Theory and Practice of Logic Programming | 2025-01-03 | Paper |
| Tight double exponential lower bounds | 2024-11-12 | Paper |
| Proofs for propositional model counting | 2024-07-12 | Paper |
Aspmc: new frontiers of algebraic answer set counting
Artificial Intelligence | 2024-07-03 | Paper |
Exploiting Database Management Systems and Treewidth for Counting
Theory and Practice of Logic Programming | 2023-12-12 | Paper |
| Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF | 2023-04-26 | Paper |
| scientific article; zbMATH DE number 7678043 (Why is no real title available?) | 2023-04-24 | Paper |
| IASCAR: incremental answer set counting by anytime refinement | 2023-04-04 | Paper |
| A practical account into counting Dung's extensions by dynamic programming | 2023-04-04 | Paper |
| The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper) | 2023-02-03 | Paper |
Solving projected model counting by utilizing treewidth and its limits
Artificial Intelligence | 2023-01-04 | Paper |
Default logic and bounded treewidth
Information and Computation | 2022-03-14 | Paper |
Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
Artificial Intelligence | 2022-03-02 | Paper |
Utilizing treewidth for quantitative reasoning on epistemic logic programs
Theory and Practice of Logic Programming | 2022-01-10 | Paper |
| scientific article; zbMATH DE number 7378698 (Why is no real title available?) | 2021-08-04 | Paper |
| Taming high treewidth with abstraction, nested dynamic programming, and database technology | 2021-04-07 | Paper |
Lower Bounds for QBFs of Bounded Treewidth
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
(available as arXiv preprint) | 2020-05-27 | Paper |
Inconsistency proofs for ASP: the ASP-DRUPE format
Theory and Practice of Logic Programming | 2020-05-04 | Paper |
Treewidth and counting projected answer sets
(available as arXiv preprint) | 2019-10-10 | Paper |
Exploiting treewidth for projected model counting and its limits
(available as arXiv preprint) | 2018-08-10 | Paper |
Default logic and bounded treewidth
Language and Automata Theory and Applications | 2018-06-26 | Paper |
D-FLAT\(^\wedge\)2: subset minimization in dynamic programming on tree decompositions made easy
Fundamenta Informaticae | 2017-11-09 | Paper |
Answer set solving with bounded treewidth revisited
(available as arXiv preprint) | 2017-09-05 | Paper |
The D-FLAT system for dynamic programming on tree decompositions
Logics in Artificial Intelligence | 2015-01-14 | Paper |
