Markus Hecher

Available identifiers

zbMath Open hecher.markusMaRDI QIDQ1647690

List of research outcomes

Publication	Date of Publication	Type
IASCAR: incremental answer set counting by anytime refinement	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	2024-07-03	Paper
Exploiting Database Management Systems and Treewidth for Counting	2023-12-12	Paper
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF	2023-04-26	Paper
https://portal.mardi4nfdi.de/entity/Q5888365	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	2023-01-04	Paper
Default logic and bounded treewidth	2022-03-14	Paper
Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?	2022-03-02	Paper
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs	2022-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q5009587	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	2021-01-21	Paper
DynASP2.5: Dynamic Programming on Tree Decompositions in Action	2020-05-27	Paper
Inconsistency Proofs for ASP: The ASP - DRUPE Format	2020-05-04	Paper
Treewidth and counting projected answer sets	2019-10-10	Paper
Exploiting treewidth for projected model counting and its limits	2018-08-10	Paper
Default logic and bounded treewidth	2018-06-26	Paper
D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy	2017-11-09	Paper
Answer set solving with bounded treewidth revisited	2017-09-05	Paper
The D-FLAT System for Dynamic Programming on Tree Decompositions	2015-01-14	Paper

Research outcomes over time

This page was built for person: Markus Hecher