| 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 |
IASCAR: incremental answer set counting by anytime refinement
Theory and Practice of Logic Programming | 2025-01-03 | Paper |
Strong backdoors for default logic
ACM Transactions on Computational Logic | 2024-09-25 | Paper |
| Proofs for propositional model counting | 2024-07-12 | Paper |
Strong backdoors for default logic
ACM Transactions on Computational Logic | 2024-07-10 | 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 |
| 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 |
| Weighted model counting on the GPU by exploiting small treewidth | 2021-08-04 | 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 |
A multiparametric view on answer set programming
Annals of Mathematics and Artificial Intelligence | 2019-08-13 | 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 |
| SAT-based local improvement for finding tree decompositions of small width | 2017-11-15 | Paper |
Dual-normal logic programs -- the forgotten class
Theory and Practice of Logic Programming | 2017-11-09 | Paper |
Answer set solving with bounded treewidth revisited
(available as arXiv preprint) | 2017-09-05 | Paper |
Backdoors to normality for disjunctive logic programs
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Strong Backdoors for Default Logic
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Backdoors to tractable answer set programming
Artificial Intelligence | 2015-05-06 | Paper |
The good, the bad, and the odd: cycles in answer-set programs
Lecture Notes in Computer Science | 2012-11-06 | Paper |
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Journal of Artificial Intelligence Research | 2011-03-08 | Paper |
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Lecture Notes in Computer Science | 2009-07-07 | Paper |
