Markus Hecher

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 91

Top Topics

Tree Decompositions

Dynamic Programming

Top Venues

Publications

Max Bannach, Markus Hecher
Structure-Guided Cube-and-Conquer for MaxSAT. NFM (2024)
Markus Hecher, Rafael Kiesel
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? CoRR (2024)
Johannes Klaus Fichte, Tobias Geibinger, Markus Hecher, Matthias Schlögel
Parallel Empirical Evaluations: Resilience despite Concurrency. AAAI (2024)
Lukas Gerlach, David Carral, Markus Hecher
Finite Groundings for ASP with Functions: A Journey through Consistency. CoRR (2024)
Ivan Bliznets, Markus Hecher
Tight Double Exponential Lower Bounds. TAMC (2024)
Markus Hecher, Rafael Kiesel
On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? AAAI (2024)
Olaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Kaspar Kasche
The Relative Strength of #SAT Proof Systems. SAT (2024)
Thomas Eiter, Markus Hecher, Rafael Kiesel
aspmc: New frontiers of algebraic answer set counting. Artif. Intell. 330 (2024)
Johannes Klaus Fichte, Markus Hecher, Arne Meier
Counting Complexity for Reasoning in Abstract Argumentation. J. Artif. Intell. Res. 80 (2024)
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran
Solving Projected Model Counting by Utilizing Treewidth and its Limits. Artif. Intell. 314 (2023)
Jorge Fandinno, Markus Hecher
Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs. IJCAI (2023)
Max Bannach, Markus Hecher
Structure-Guided Automated Reasoning. CoRR (2023)
Markus Hecher
Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth? CoRR (2023)
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. LICS (2023)
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. CoRR (2023)
Viktor Besin, Markus Hecher, Stefan Woltran
On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth. ECAI (2023)
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. IJCAI (2023)
Markus Hecher
Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth? AAAI (2023)
Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider
The Silent (R)evolution of SAT. Commun. ACM 66 (6) (2023)
Augusto B. Corrêa, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening, Stefan Woltran
Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. ICAPS (2023)
Markus Hecher, Rafael Kiesel
The Impact of Structure in Answer Set Counting: Fighting Cycles and its Limits. KR (2023)
Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac
IASCAR: Incremental Answer Set Counting by Anytime Refinement. CoRR (2023)
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity. AAAI (2023)
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran
Solving Projected Model Counting by Utilizing Treewidth and its Limits. CoRR (2023)
Markus Hecher
Advanced tools and methods for treewidth-based problem solving. it Inf. Technol. 65 (1-2) (2023)
Markus Hecher
Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? CoRR (2022)
Johannes Klaus Fichte, Markus Hecher, Mohamed A. Nadeem
Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach. IJCAI (2022)
Viktor Besin, Markus Hecher, Stefan Woltran
Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck. IJCAI (2022)
Markus Hecher
Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? Artif. Intell. 304 (2022)
Markus Hecher
Advanced Tools and Methods for Treewidth-Based Problem Solving - Extended Abstract. CoRR (2022)
Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac
IASCAR: Incremental Answer Set Counting by Anytime Refinement. LPNMR (2022)
Johannes Klaus Fichte, Markus Hecher, Valentin Roland
Proofs for Propositional Model Counting. SAT (2022)
Mohimenul Kabir, Flavio O. Everardo, Ankit K. Shukla, Markus Hecher, Johannes Klaus Fichte, Kuldeep S. Meel
ApproxASP - a Scalable Approximate Answer Set Counter. AAAI (2022)
Ridhwan Dewoprabowo, Johannes Klaus Fichte, Piotr Jerzy Gorczyca, Markus Hecher
A Practical Account into Counting Dung's Extensions by Dynamic Programming. LPNMR (2022)
Viktor Besin, Markus Hecher, Stefan Woltran
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract). IJCAI (2022)
Johannes Klaus Fichte, Markus Hecher, Irina Schindler
Default logic and bounded treewidth. Inf. Comput. 283 (2022)
Wolfgang Dvorák, Markus Hecher, Matthias König, André Schidler, Stefan Szeider, Stefan Woltran
Tractable Abstract Argumentation via Backdoor-Treewidth. AAAI (2022)
Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran
Exploiting Database Management Systems and Treewidth for Counting. Theory Pract. Log. Program. 22 (1) (2022)
Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab
Complications for Computational Experiments from Modern Processors. CP (2021)
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. Algorithms 14 (3) (2021)
Thomas Eiter, Markus Hecher, Rafael Kiesel
aspmc: An Algebraic Answer Set Counter. ICLP Workshops (2021)
Viktor Besin, Markus Hecher, Stefan Woltran
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs. CoRR (2021)
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
Decomposition-Guided Reductions for Argumentation and Treewidth. IJCAI (2021)
Thomas Eiter, Markus Hecher, Rafael Kiesel
Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. KR (2021)
Johannes Klaus Fichte, Markus Hecher, Arne Meier
Knowledge-Base Degrees of Inconsistency: Complexity and Counting. AAAI (2021)
Jorge Fandinno, Markus Hecher
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard. AAAI (2021)
Johannes Klaus Fichte, Markus Hecher, Valentin Roland
Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization. CP (2021)
Viktor Besin, Markus Hecher, Stefan Woltran
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs. Theory Pract. Log. Program. 21 (5) (2021)
Johannes Klaus Fichte, Markus Hecher, Florim Hamiti
The Model Counting Competition 2020. ACM J. Exp. Algorithmics 26 (2021)
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
A Time Leap Challenge for SAT Solving. CoRR (2020)
Markus Hecher, Jorge Fandinno
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard. CoRR (2020)
Markus Hecher, Michael Morak, Stefan Woltran
Structural Decompositions of Epistemic Logic Programs. ICLP Workshops (2020)
Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran
Exploiting Database Management Systems and Treewidth for Counting. CoRR (2020)
Markus Hecher, Patrick Thier, Stefan Woltran
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. SAT (2020)
Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran
Exploiting Database Management Systems and Treewidth for Counting. PADL (2020)
Markus Hecher, Michael Morak, Stefan Woltran
Structural Decompositions of Epistemic Logic Programs. CoRR (2020)
Johannes Klaus Fichte, Markus Hecher, André Schidler
Solving the Steiner Tree Problem with few Terminals. CoRR (2020)
Johannes Klaus Fichte, Markus Hecher, Florim Hamiti
The Model Counting Competition 2020. CoRR (2020)
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
Breaking Symmetries with RootClique and LexTopSort. CP (2020)
Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler
Treewidth-Aware Quantifier Elimination and Expansion for QCSP. CP (2020)
Markus Hecher, Michael Morak, Stefan Woltran
Structural Decompositions of Epistemic Logic Programs. AAAI (2020)
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
A Time Leap Challenge for SAT-Solving. CP (2020)
Markus Hecher
Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? KR (2020)
Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler
Lower Bounds for QBFs of Bounded Treewidth. LICS (2020)
Johannes Klaus Fichte, Markus Hecher, André Schidler
Solving the Steiner Tree Problem with few Terminals. ICTAI (2020)
Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath
Inconsistency Proofs for ASP: The ASP-DRUPE Format. CoRR (2019)
M. Ayaz Dzulfikar, Johannes Klaus Fichte, Markus Hecher
The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper). IPEC (2019)
Markus Hecher
Answer Set Solving exploiting Treewidth and its Limits. CoRR (2019)
Johannes Klaus Fichte, Markus Hecher
Treewidth and Counting Projected Answer Sets. LPNMR (2019)
Johannes Klaus Fichte, Markus Hecher, Arne Meier
Counting Complexity for Reasoning in Abstract Argumentation. AAAI (2019)
Johannes Klaus Fichte, Markus Hecher, Markus Zisser
An Improved GPU-Based SAT Model Counter. CP (2019)
Johannes Klaus Fichte, Markus Hecher
Treewidth and Counting Projected Answer Sets. CoRR (2019)
Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler
TE-ETH: Lower Bounds for QBFs of Bounded Treewidth. CoRR (2019)
Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath
Inconsistency Proofs for ASP: The ASP - DRUPE Format. Theory Pract. Log. Program. 19 (5-6) (2019)
Johannes Klaus Fichte, Markus Hecher
Exploiting Treewidth for Counting Projected Answer Sets. KR (2018)
Johannes Klaus Fichte, Markus Hecher, Arne Meier
Counting Complexity for Reasoning in Abstract Argumentation. CoRR (2018)
Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser
Weighted Model Counting on the GPU by Exploiting Small Treewidth. ESA (2018)
Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan, Stefan Woltran
Dynamic Programming on Tree Decompositions with D-FLAT. Künstliche Intell. 32 (2-3) (2018)
Johannes Klaus Fichte, Markus Hecher, Irina Schindler
Default Logic and Bounded Treewidth. LATA (2018)
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
Exploiting Treewidth for Projected Model Counting and Its Limits. SAT (2018)
Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider
An SMT Approach to Fractional Hypertree Width. CP (2018)
Johannes Klaus Fichte, Michael Morak, Markus Hecher, Stefan Woltran
Exploiting Treewidth for Projected Model Counting and its Limits. CoRR (2018)
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
Answer Set Solving with Bounded Treewidth Revisited. LPNMR (2017)
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. IPEC (2017)
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
Answer Set Solving with Bounded Treewidth Revisited. CoRR (2017)
Johannes Klaus Fichte, Markus Hecher, Irina Schindler
Default Logic and Bounded Treewidth. CoRR (2017)
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. CoRR (2017)
Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran
: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. Fundam. Informaticae 147 (1) (2016)
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
Counting Answer Sets via Dynamic Programming. CoRR (2016)
Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran
Subset Minimization in Dynamic Programming on Tree Decompositions. AAAI Workshop: Beyond NP (2016)
Bernhard Bliem, Markus Hecher, Stefan Woltran
On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. COMMA (2016)
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran
The D-FLAT System for Dynamic Programming on Tree Decompositions. JELIA (2014)