Markus Hecher

143 papers A* 37A 15B 12C 5Journal 57Unranked 9
YearRankTypeTitle / Venue / Authors
2026 — conf
A Novel Reduction from #SAT to #2SAT Based on Symmetry:
SOSA
Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher
2026 A* conf
Structure-Aware Encodings of Argumentation Properties for Clique-width.
AAAI
Yasir Mahmood, Markus Hecher, Johanna Groven, Johannes Klaus Fichte
2025 A* conf
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
LICS
Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher
2025 J jnl
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
CoRR
Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher
2025 J jnl
Automated Hybrid Grounding Using Structural and Data-Driven Heuristics.
CoRR
Alexander Beiser, Markus Hecher, Stefan Woltran
2025 J jnl
Automated Hybrid Grounding Using Structural and Data-Driven Heuristics.
Theory Pract. Log. Program.
Alexander Beiser, Stefan Woltran, Markus Hecher
2025 J jnl
Continuous Flattening and Reversing of Convex Polyhedral Linkages.
J. Inf. Process.
Erik D. Demaine, Martin L. Demaine, Markus Hecher, Rebecca Lin, Victor Luo, Chie Nara
2025 A* conf
Counting Solutions Under Cardinality Constraints: Structure Counts in Counting.
KR
Max Bannach, Markus Hecher
2025 A* conf
Counting and Reasoning with Plans.
AAAI
David Speck, Markus Hecher, Daniel Gnad, Johannes Klaus Fichte, Augusto B. Corrêa
2025 J jnl
Counting and Reasoning with Plans.
CoRR
David Speck, Markus Hecher, Daniel Gnad, Johannes Klaus Fichte, Augusto B. Corrêa
2025 A* conf
Dung's Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases.
AAAI
Yasir Mahmood, Markus Hecher, Axel-Cyrille Ngonga Ngomo
2025 C conf
ETH Lower Bounds for n-Queens: Time Waits for Nobody.
IWOCA
Josh Brunner, Erik D. Demaine, Timothy Gomez, Markus Hecher, Meryl Zhang
2025 J jnl
Epistemic Logic Programs: Non-Ground and Counting Complexity.
CoRR
Thomas Eiter, Johannes Klaus Fichte, Markus Hecher, Stefan Woltran
2025 A* conf
Facets in Argumentation: A Formal Approach to Argument Significance.
IJCAI
Johannes Klaus Fichte, Nicolas Fröhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson
2025 J jnl
Facets in Argumentation: A Formal Approach to Argument Significance.
CoRR
Johannes Klaus Fichte, Nicolas Fröhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson
2025 A* conf
FastFound: Easing the ASP Bottleneck via Predicate-Decoupled Grounding.
KR
Alexander Beiser, Martin Gebser, Markus Hecher, Stefan Woltran
2025 J jnl
Folding One Polyhedral Metric Graph into Another.
J. Inf. Process.
Lily Chung, Erik D. Demaine, Martin L. Demaine, Markus Hecher, Rebecca Lin, Jayson Lynch, Chie Nara
2025 J jnl
From Alternation to FPRAS: Toward a Complexity Classification of Approximate Counting.
CoRR
Markus Hecher, Matthias Lanzinger
2025 — conf
Hardness of Traversing Gadget Systems with Small Bandwidth.
SAND
MIT Gadgets Group, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Jayson Lynch
2025 A* conf
Interactive Exploration of Plan Spaces.
KR
Daniel Gnad, Markus Hecher, Sarah Alice Gaggl, Dominik Rusovac, David Speck, Johannes Klaus Fichte
2025 — ed.
Joint Proceedings of the Workshops and Doctoral Consortium of the 41st International Conference on Logic Programming (ICLP-WS-DC 2025) co-located with 41st International Conference on Logic Programming (ICLP 2025), Rende, Italy, September 9-13, 2025.
ICLP Workshops
Damiano Azzolini, Sotirios Batsakis, Manuel Alejandro Borroto Santana, Pierangela Bruno, Laura Andrea Cecchi, Jorge Fandinno, Markus Hecher, Marco Maratea, José F. Morales, Brais Muñiz, Emmanuel Papadakis, Livio Robaldo, Luciano Serafini, Fabrizio Lo Scudo, Ilias Tachmazidis, Alice Tarzariol, Mauro Vallati, Adam Wyner
2025 A* conf
Reasoning with Restricted Statistical Statements in Probabilistic Answer Set Programming: Complexity and Algorithms.
KR
Damiano Azzolini, Markus Hecher
2025 — conf
Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators.
NFM
Max Bannach, Jai Grover, Markus Hecher
2025 J jnl
Structure-Aware Encodings of Argumentation Properties for Clique-width.
CoRR
Yasir Mahmood, Markus Hecher, Johanna Groven, Johannes Klaus Fichte
2025 A conf
Structure-Guided Automated Reasoning.
STACS
Max Bannach, Markus Hecher
2025 J jnl
The Model Counting Competitions 2021-2023.
CoRR
Johannes Klaus Fichte, Markus Hecher
2024 — conf
A First Journey into the Complexity of Statistical Statements in Probabilistic Answer Set Programming.
ICLP Workshops
Damiano Azzolini, Markus Hecher
2024 A* conf
Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting.
IJCAI
Alexander Beiser, Markus Hecher, Kaan Unalan, Stefan Woltran
2024 J jnl
Continuous Flattening and Reversing of Convex Polyhedral Linkages.
CoRR
Erik D. Demaine, Martin L. Demaine, Markus Hecher, Rebecca Lin, Victor Luo, Chie Nara
2024 J jnl
Counting Complexity for Reasoning in Abstract Argumentation.
J. Artif. Intell. Res.
Johannes Klaus Fichte, Markus Hecher, Arne Meier
2024 B conf
Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds.
DNA
Erik D. Demaine, Timothy Gomez, Elise Grizzell, Markus Hecher, Jayson Lynch, Robert Schweller, Ahmed Shalaby, Damien Woods
2024 J jnl
Dung's Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases.
CoRR
Yasir Mahmood, Markus Hecher, Axel-Cyrille Ngonga Ngomo
2024 B conf
Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs.
ISAAC
MIT Hardness Group, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Frederick Stock, Zixiang Zhou
2024 A* conf
Epistemic Logic Programs: Non-Ground and Counting Complexity.
IJCAI
Thomas Eiter, Johannes Klaus Fichte, Markus Hecher, Stefan Woltran
2024 J jnl
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
CoRR
Markus Hecher, Rafael Kiesel
2024 — conf
Finite Groundings for ASP with Functions: A Journey through Consistency (Extended Abstract).
NMR
Lukas Gerlach, David Carral, Markus Hecher
2024 A* conf
Finite Groundings for ASP with Functions: A Journey through Consistency.
IJCAI
Lukas Gerlach, David Carral, Markus Hecher
2024 J jnl
Finite Groundings for ASP with Functions: A Journey through Consistency.
CoRR
Lukas Gerlach, David Carral, Markus Hecher
2024 J jnl
Folding One Polyhedral Metric Graph into Another.
CoRR
Lily Chung, Erik D. Demaine, Martin L. Demaine, Markus Hecher, Rebecca Lin, Jayson Lynch, Chie Nara
2024 B conf
Forgetting in Counting and Bounded Treewidth.
ICTAI
Johannes Klaus Fichte, Markus Hecher
2024 J jnl
IASCAR: Incremental Answer Set Counting by Anytime Refinement.
Theory Pract. Log. Program.
Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac
2024 A* conf
Navigating and Querying Answer Sets: How Hard Is It Really and Why?
KR
Dominik Rusovac, Markus Hecher, Martin Gebser, Sarah Alice Gaggl, Johannes Klaus Fichte
2024 B conf
On Weighted Maximum Model Counting: Complexity and Fragments.
ICTAI
Max Bannach, Markus Hecher
2024 A* conf
On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
AAAI
Markus Hecher, Rafael Kiesel
2024 A* conf
Parallel Empirical Evaluations: Resilience despite Concurrency.
AAAI
Johannes Klaus Fichte, Tobias Geibinger, Markus Hecher, Matthias Schlögel
2024 A* conf
Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.
IJCAI
Markus Hecher, Yasir Mahmood, Arne Meier, Johannes Schmidt
2024 A conf
Rejection in Abstract Argumentation: Harder Than Acceptance?
ECAI
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
2024 J jnl
Rejection in Abstract Argumentation: Harder Than Acceptance?
CoRR
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
2024 J jnl
Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators.
CoRR
Max Bannach, Jai Grover, Markus Hecher
2024 — conf
Structure-Guided Cube-and-Conquer for MaxSAT.
NFM
Max Bannach, Markus Hecher
2024 A conf
The Relative Strength of #SAT Proof Systems.
SAT
Olaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Kaspar Kasche
2024 C conf
Tight Double Exponential Lower Bounds.
TAMC
Ivan Bliznets, Markus Hecher
2024 — ed.
Workshop Proceedings of the 40th International Conference on Logic Programming (ICLP-WS 2024) co-located with the 40th International Conference on Logic Programming (ICLP 2024), Dallas, TX, USA, October 12th and 13th, 2024.
ICLP Workshops
Joaquín Arias, Damiano Azzolini, Kinjal Basu, Verónica Dahl, Markus Hecher, Francesco Pacenza, Zeynep G. Saribatur, Sarat Chandra Varanasi
2024 J jnl
aspmc: New frontiers of algebraic answer set counting.
Artif. Intell.
Thomas Eiter, Markus Hecher, Rafael Kiesel
2023 J jnl
Advanced tools and methods for treewidth-based problem solving.
it Inf. Technol.
Markus Hecher
2023 A* conf
Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?
AAAI
Markus Hecher
2023 J jnl
Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?
CoRR
Markus Hecher
2023 A* conf
Grounding Planning Tasks Using Tree Decompositions and Iterated Solving.
ICAPS
Augusto B. Corrêa, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening, Stefan Woltran
2023 J jnl
IASCAR: Incremental Answer Set Counting by Anytime Refinement.
CoRR
Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac
2023 A* conf
Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity.
AAAI
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
2023 A conf
On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth.
ECAI
Viktor Besin, Markus Hecher, Stefan Woltran
2023 A* conf
Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.
IJCAI
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
2023 J jnl
Solving Projected Model Counting by Utilizing Treewidth and its Limits.
Artif. Intell.
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran
2023 J jnl
Solving Projected Model Counting by Utilizing Treewidth and its Limits.
CoRR
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran
2023 A* conf
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.
LICS
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
2023 J jnl
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.
CoRR
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
2023 J jnl
Structure-Guided Automated Reasoning.
CoRR
Max Bannach, Markus Hecher
2023 A* conf
The Impact of Structure in Answer Set Counting: Fighting Cycles and its Limits.
KR
Markus Hecher, Rafael Kiesel
2023 J jnl
The Silent (R)evolution of SAT.
Commun. ACM
Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider
2023 A* conf
Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs.
IJCAI
Jorge Fandinno, Markus Hecher
2022 B conf
A Practical Account into Counting Dung's Extensions by Dynamic Programming.
LPNMR
Ridhwan Dewoprabowo, Johannes Klaus Fichte, Piotr Jerzy Gorczyca, Markus Hecher
2022 — book
Advanced Tools and Methods for Treewidth-Based Problem Solving
Markus Hecher
2022 J jnl
Advanced Tools and Methods for Treewidth-Based Problem Solving - Extended Abstract.
CoRR
Markus Hecher
2022 A* conf
ApproxASP - a Scalable Approximate Answer Set Counter.
AAAI
Mohimenul Kabir, Flavio O. Everardo, Ankit K. Shukla, Markus Hecher, Johannes Klaus Fichte, Kuldeep S. Meel
2022 A* conf
Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck.
IJCAI
Viktor Besin, Markus Hecher, Stefan Woltran
2022 J jnl
Default logic and bounded treewidth.
Inf. Comput.
Johannes Klaus Fichte, Markus Hecher, Irina Schindler
2022 J jnl
Exploiting Database Management Systems and Treewidth for Counting.
Theory Pract. Log. Program.
Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran
2022 B conf
IASCAR: Incremental Answer Set Counting by Anytime Refinement.
LPNMR
Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac
2022 A* conf
Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach.
IJCAI
Johannes Klaus Fichte, Markus Hecher, Mohamed A. Nadeem
2022 — ed.
Proceedings of the International Conference on Logic Programming 2022 Workshops co-located with the 38th International Conference on Logic Programming (ICLP 2022), Haifa, Israel, July 31st - August 1st, 2022.
ICLP Workshops
Joaquín Arias, Roberta Calegari, Luke Dickens, Wolfgang Faber, Jorge Fandinno, Gopal Gupta, Markus Hecher, Daniela Inclezan, Emily Leblanc, Michael Morak, Elmer Salazar, Jessica Zangari
2022 A conf
Proofs for Propositional Model Counting.
SAT
Johannes Klaus Fichte, Markus Hecher, Valentin Roland
2022 A* conf
Tractable Abstract Argumentation via Backdoor-Treewidth.
AAAI
Wolfgang Dvorák, Markus Hecher, Matthias König, André Schidler, Stefan Szeider, Stefan Woltran
2022 J jnl
Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All?
CoRR
Markus Hecher
2022 J jnl
Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all?
Artif. Intell.
Markus Hecher
2022 A* conf
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract).
IJCAI
Viktor Besin, Markus Hecher, Stefan Woltran
2021 — —
Advanced tools and methods for treewidth-based problem solving
Markus Hecher
2021 A conf
Complications for Computational Experiments from Modern Processors.
CP
Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab
2021 A* conf
Decomposition-Guided Reductions for Argumentation and Treewidth.
IJCAI
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
2021 J jnl
DynASP2.5: Dynamic Programming on Tree Decompositions in Action.
Algorithms
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2021 A* conf
Knowledge-Base Degrees of Inconsistency: Complexity and Counting.
AAAI
Johannes Klaus Fichte, Markus Hecher, Arne Meier
2021 A conf
Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization.
CP
Johannes Klaus Fichte, Markus Hecher, Valentin Roland
2021 — ed.
Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021), Porto, Portugal (virtual), September 20th-21st, 2021.
ICLP Workshops
Joaquín Arias, Fabio Aurelio D'Asaro, Abeer Dyoub, Gopal Gupta, Markus Hecher, Emily Leblanc, Rafael Peñaloza, Elmer Salazar, Ari Saptawijaya, Felix Weitkämper, Jessica Zangari
2021 J jnl
The Model Counting Competition 2020.
ACM J. Exp. Algorithmics
Johannes Klaus Fichte, Markus Hecher, Florim Hamiti
2021 A* conf
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard.
AAAI
Jorge Fandinno, Markus Hecher
2021 A* conf
Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting.
KR
Thomas Eiter, Markus Hecher, Rafael Kiesel
2021 J jnl
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs.
CoRR
Viktor Besin, Markus Hecher, Stefan Woltran
2021 J jnl
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs.
Theory Pract. Log. Program.
Viktor Besin, Markus Hecher, Stefan Woltran
2021 — ch.
Werkzeuge und Methoden zum Lösen von Problemen mittels Baumweite .
Ausgezeichnete Informatikdissertationen
Markus Hecher
2021 — conf
aspmc: An Algebraic Answer Set Counter.
ICLP Workshops
Thomas Eiter, Markus Hecher, Rafael Kiesel
2020 J jnl
A Time Leap Challenge for SAT Solving.
CoRR
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
2020 A conf
A Time Leap Challenge for SAT-Solving.
CP
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
2020 A conf
Breaking Symmetries with RootClique and LexTopSort.
CP
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
2020 C conf
Exploiting Database Management Systems and Treewidth for Counting.
PADL
Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran
2020 J jnl
Exploiting Database Management Systems and Treewidth for Counting.
CoRR
Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran
2020 — ed.
International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), Rende, Italy, September 18-19, 2020.
ICLP Workshops
Carmine Dodaro, George Aristidis Elder, Wolfgang Faber, Jorge Fandinno, Martin Gebser, Markus Hecher, Emily Leblanc, Michael Morak, Jessica Zangari
2020 A* conf
Lower Bounds for QBFs of Bounded Treewidth.
LICS
Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler
2020 B conf
Solving the Steiner Tree Problem with few Terminals.
ICTAI
Johannes Klaus Fichte, Markus Hecher, André Schidler
2020 J jnl
Solving the Steiner Tree Problem with few Terminals.
CoRR
Johannes Klaus Fichte, Markus Hecher, André Schidler
2020 A* conf
Structural Decompositions of Epistemic Logic Programs.
AAAI
Markus Hecher, Michael Morak, Stefan Woltran
2020 — conf
Structural Decompositions of Epistemic Logic Programs.
ICLP Workshops
Markus Hecher, Michael Morak, Stefan Woltran
2020 J jnl
Structural Decompositions of Epistemic Logic Programs.
CoRR
Markus Hecher, Michael Morak, Stefan Woltran
2020 A conf
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology.
SAT
Markus Hecher, Patrick Thier, Stefan Woltran
2020 J jnl
The Model Counting Competition 2020.
CoRR
Johannes Klaus Fichte, Markus Hecher, Florim Hamiti
2020 J jnl
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard.
CoRR
Markus Hecher, Jorge Fandinno
2020 A conf
Treewidth-Aware Quantifier Elimination and Expansion for QCSP.
CP
Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler
2020 A* conf
Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All?
KR
Markus Hecher
2019 A conf
An Improved GPU-Based SAT Model Counter.
CP
Johannes Klaus Fichte, Markus Hecher, Markus Zisser
2019 J jnl
Answer Set Solving exploiting Treewidth and its Limits.
CoRR
Markus Hecher
2019 A* conf
Counting Complexity for Reasoning in Abstract Argumentation.
AAAI
Johannes Klaus Fichte, Markus Hecher, Arne Meier
2019 J jnl
Inconsistency Proofs for ASP: The ASP - DRUPE Format.
Theory Pract. Log. Program.
Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath
2019 J jnl
Inconsistency Proofs for ASP: The ASP-DRUPE Format.
CoRR
Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath
2019 J jnl
TE-ETH: Lower Bounds for QBFs of Bounded Treewidth.
CoRR
Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler
2019 B conf
The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper).
IPEC
Muhammad Ayaz Dzulfikar, Johannes Klaus Fichte, Markus Hecher
2019 B conf
Treewidth and Counting Projected Answer Sets.
LPNMR
Johannes Klaus Fichte, Markus Hecher
2019 J jnl
Treewidth and Counting Projected Answer Sets.
CoRR
Johannes Klaus Fichte, Markus Hecher
2018 A conf
An SMT Approach to Fractional Hypertree Width.
CP
Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider
2018 J jnl
Counting Complexity for Reasoning in Abstract Argumentation.
CoRR
Johannes Klaus Fichte, Markus Hecher, Arne Meier
2018 C conf
Default Logic and Bounded Treewidth.
LATA
Johannes Klaus Fichte, Markus Hecher, Irina Schindler
2018 J jnl
Dynamic Programming on Tree Decompositions with D-FLAT.
Künstliche Intell.
Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan, Stefan Woltran
2018 A* conf
Exploiting Treewidth for Counting Projected Answer Sets.
KR
Johannes Klaus Fichte, Markus Hecher
2018 A conf
Exploiting Treewidth for Projected Model Counting and Its Limits.
SAT
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2018 J jnl
Exploiting Treewidth for Projected Model Counting and its Limits.
CoRR
Johannes Klaus Fichte, Michael Morak, Markus Hecher, Stefan Woltran
2018 A conf
Weighted Model Counting on the GPU by Exploiting Small Treewidth.
ESA
Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser
2017 B conf
Answer Set Solving with Bounded Treewidth Revisited.
LPNMR
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2017 J jnl
Answer Set Solving with Bounded Treewidth Revisited.
CoRR
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2017 J jnl
Default Logic and Bounded Treewidth.
CoRR
Johannes Klaus Fichte, Markus Hecher, Irina Schindler
2017 B conf
DynASP2.5: Dynamic Programming on Tree Decompositions in Action.
IPEC
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2017 J jnl
DynASP2.5: Dynamic Programming on Tree Decompositions in Action.
CoRR
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2016 J jnl
Counting Answer Sets via Dynamic Programming.
CoRR
Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran
2016 J jnl
D-FLAT
Fundam. Informaticae
Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran
2016 C conf
On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions.
COMMA
Bernhard Bliem, Markus Hecher, Stefan Woltran
2016 — conf
Subset Minimization in Dynamic Programming on Tree Decompositions.
AAAI Workshop: Beyond NP
Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran
2014 B conf
The D-FLAT System for Dynamic Programming on Tree Decompositions.
JELIA
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran