Markus Hecher

Orcid: 0000-0003-0131-6771

According to our database1, Markus Hecher authored at least 65 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
CoRR, 2024

On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Parallel Empirical Evaluations: Resilience despite Concurrency.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
The Silent (R)evolution of SAT.
Commun. ACM, June, 2023

Advanced tools and methods for treewidth-based problem solving.
it Inf. Technol., May, 2023

Structure-Guided Automated Reasoning.
CoRR, 2023

Solving Projected Model Counting by Utilizing Treewidth and its Limits.
Artif. Intell., 2023

Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.
LICS, 2023

The Impact of Structure in Answer Set Counting: Fighting Cycles and its Limits.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Grounding Planning Tasks Using Tree Decompositions and Iterated Solving.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Exploiting Database Management Systems and Treewidth for Counting.
Theory Pract. Log. Program., 2022

Default logic and bounded treewidth.
Inf. Comput., 2022

Advanced Tools and Methods for Treewidth-Based Problem Solving - Extended Abstract.
CoRR, 2022

Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all?
Artif. Intell., 2022

Proofs for Propositional Model Counting.
Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

IASCAR: Incremental Answer Set Counting by Anytime Refinement.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2022

A Practical Account into Counting Dung's Extensions by Dynamic Programming.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2022

Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract).
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

ApproxASP - a Scalable Approximate Answer Set Counter.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Tractable Abstract Argumentation via Backdoor-Treewidth.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Advanced Tools and Methods for Treewidth-Based Problem Solving
Frontiers in Artificial Intelligence and Applications 359, IOS Press, ISBN: 978-1-64368-345-4, 2022

2021
Werkzeuge und Methoden zum Lösen von Problemen mittels Baumweite .
Proceedings of the Ausgezeichnete Informatikdissertationen 2021., 2021

Advanced tools and methods for treewidth-based problem solving
PhD thesis, 2021

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs.
Theory Pract. Log. Program., 2021

The Model Counting Competition 2020.
ACM J. Exp. Algorithmics, 2021

DynASP2.5: Dynamic Programming on Tree Decompositions in Action.
Algorithms, 2021

Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Decomposition-Guided Reductions for Argumentation and Treewidth.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

aspmc: An Algebraic Answer Set Counter.
Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021), 2021

Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Complications for Computational Experiments from Modern Processors.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Knowledge-Base Degrees of Inconsistency: Complexity and Counting.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Lower Bounds for QBFs of Bounded Treewidth.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Solving the Steiner Tree Problem with few Terminals.
Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

Structural Decompositions of Epistemic Logic Programs.
Proceedings of the International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), 2020

Breaking Symmetries with RootClique and LexTopSort.
Proceedings of the Principles and Practice of Constraint Programming, 2020

A Time Leap Challenge for SAT-Solving.
Proceedings of the Principles and Practice of Constraint Programming, 2020

Treewidth-Aware Quantifier Elimination and Expansion for QCSP.
Proceedings of the Principles and Practice of Constraint Programming, 2020

2019
Inconsistency Proofs for ASP: The ASP - DRUPE Format.
Theory Pract. Log. Program., 2019

TE-ETH: Lower Bounds for QBFs of Bounded Treewidth.
CoRR, 2019

Answer Set Solving exploiting Treewidth and its Limits.
CoRR, 2019

Treewidth and Counting Projected Answer Sets.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2019

The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper).
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

An Improved GPU-Based SAT Model Counter.
Proceedings of the Principles and Practice of Constraint Programming, 2019

Counting Complexity for Reasoning in Abstract Argumentation.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Dynamic Programming on Tree Decompositions with D-FLAT.
Künstliche Intell., 2018

Exploiting Treewidth for Projected Model Counting and Its Limits.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Exploiting Treewidth for Counting Projected Answer Sets.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Weighted Model Counting on the GPU by Exploiting Small Treewidth.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

An SMT Approach to Fractional Hypertree Width.
Proceedings of the Principles and Practice of Constraint Programming, 2018

2017
Answer Set Solving with Bounded Treewidth Revisited.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2017

2016
D-FLAT<sup>2</sup>: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy.
Fundam. Informaticae, 2016

Counting Answer Sets via Dynamic Programming.
CoRR, 2016

On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions.
Proceedings of the Computational Models of Argument, 2016

Subset Minimization in Dynamic Programming on Tree Decompositions.
Proceedings of the Beyond NP, 2016

2014
The D-FLAT System for Dynamic Programming on Tree Decompositions.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014


  Loading...