Skip to Content

TU Wien Fakultät für Informatik DBAI Database and Artificial Intelligence Group
Top-level Navigation: Current-level Navigation:

Path: DBAI > staff > Markus Hecher

Tools: Drucken


Markus Hecher

Address MIT Computer Science & Artificial Intelligence Laboratory
Massachusetts Institute of Technology
32 Vassar St
Cambridge, MA 02139
USA

CRIL-CNRS UMR 8188
University d'Artois
Faculte des sciences Jean Perrin
Rue Jean Souvraz SP18
France
  
Mail [surname] [at] mit edu

You can find me in the TISS Adress Book

Research


My new CNRS position at CRIL (Lens, France) (CNRS, permanent research position) starts in January 2025.

I am currently a postdoctoral researcher at the Computer Science and AI Lab (CSAIL) at the Massachusetts Institute of Technology (MIT), working with Erik Demaine. This research is part of an FWF Erwin Schrödinger grant for "QuantASP" for a 3-year project on novel ideas for quantitative reasoning via logic programming. In autumn 2023 I received a Simons-Berkeley Research Fellowship for participating in the program Logic and Algorithms in Database Theory and AI.

Before that I was a postdoc in the Database and Artificial Intelligence Group of the Vienna University of Technology. In Spring 2021, I have been an invited visiting graduate student at UC Berkeley, where I managed to physically participate in the form of an experimental outdoor collaboration program. Since then, I finished my binational PhD thesis in July 2021, according to an individual agreement between TU Wien (Austria) and the University of Potsdam (Germany). This thesis has been supervised by Stefan Woltran (TU Wien, Austria) and Torsten Schaub (University of Potsdam, Germany). I am employed as a project assistant in the "Hypar" project ("Hybrid Parameterized Problem Solving in Practice") and I am also involved in the "Reveal" project ("Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI"). Previously, I was engaged in the projects "D-FLAT" ("Extending the Answer Set Programming Paradigm to Decomposed Problem Solving") and "Decodyn" ("Treating Hard Problems with Decomposition and Dynamic Programming").

Grants

Offered Positions

Invited Talks

Awards

Organized Competitions and Workshops

Steering Committee Member

Reviewing

Volunteering

Teaching

(Co-)supervision


I contributed to the supervision of the following theses at TU Wien, all of these resulted in interesting follow-up publications. Viktor Besin recently got awarded with the ASAI award 2023 for the best master thesis on AI in Austria (reported also by TU Wien Informatics).

Publications

See also: DBLP

Selected Representative Works

2024

  1. MIT Hardness Group, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Frederick Stock and Zixiang Zhou Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs In The 35th International Symposium on Algorithms and Computation (ISAAC 2024), 2024.
    [ BibTeX ]
  2. Dominik Rusovac, Markus Hecher, Martin Gebser, Sarah A. Gaggl and Johannes K. Fichte Navigating and Querying Answer Sets: How Hard Is It Really and Why? In 21st International Conference on Principles of Knowledge Representation and Reasoning (KR), 2024.
    [ BibTeX ]
  3. Erik D. Demaine, Timothy Gomez, Elise Grizzell, Markus Hecher, Jayson Lynch, Robert Schweller, Ahmed Shalaby and Damien Woods Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds In The 30th International Conference on DNA Computing and Molecular Programming, 2024.
    [ BibTeX ]
  4. Olaf Beyersdorff, Johannes K. Fichte, Markus Hecher, Tim Hoffmann and Kaspar Kasche The Relative Strength of #SAT Proof Systems In 27th International Conference on Theory and Applications of Satisfiability Testing (SAT), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
    [ BibTeX ]
  5. Johannes K. Fichte, Markus Hecher and Arne Meier Counting Complexity for Reasoning in Abstract Argumentation In J. Artif. Intell. Research, 2024.
    [ BibTeX ]
  6. Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood and Arne Meier Rejection in Abstract Argumentation: Harder Than Acceptance? In 27th European Conference on Artificial Intelligence (ECAI), 2024.
    [ BibTeX ]
  7. Thomas Eiter, Johannes Klaus Fichte, Markus Hecher and Stefan Woltran Epistemic Logic Programs: Non-Ground and Counting Complexity In 33rd International Joint Conference on Artificial Intelligence (IJCAI), ijcai.org, 2024.
    [ BibTeX ]
  8. Lukas Gerlach, David Carral and Markus Hecher Finite Groundings for ASP with Functions: A Journey through Consistency In 33rd International Joint Conference on Artificial Intelligence (IJCAI), ijcai.org, 2024.
    [ BibTeX ]
  9. Markus Hecher, Yasir Mahmood, Arne Meier and Johannes Schmidt Quantitative Claim-Centric Reasoning in Logic-Based Argumentation In 33rd International Joint Conference on Artificial Intelligence (IJCAI), ijcai.org, 2024.
    [ BibTeX ]
  10. Alexander Beiser, Markus Hecher, Kaan Unalan and Stefan Woltran Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting In 33rd International Joint Conference on Artificial Intelligence (IJCAI), ijcai.org, 2024.
    [ BibTeX ]
  11. Max Bannach and Markus Hecher On Weighted Maximum Model Counting: Complexity and Fragments In 36th International Conference on Tools with Artificial Intelligence (ICTAI'24), 2024.
    [ BibTeX ]
  12. Johannes K. Fichte and Markus Hecher Forgetting in Counting and Bounded Treewidth In 36th International Conference on Tools with Artificial Intelligence (ICTAI'24), 2024.
    [ BibTeX ]
  13. Max Bannach and Markus Hecher Structure-guided Cube-and-conquer for MaxSAT In 16th NASA Formal Methods Symposium (NFM), 2024.
    [ BibTeX ]
  14. Thomas Eiter, Markus Hecher and Rafael Kiesel Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting In Artif. Intell., 2024.
    [ BibTeX | pdf  ]
  15. Johannes K. Fichte, Markus Hecher, Sarah A. Gaggl and Dominik Rusovac IASCAR: Incremental Answer Set Counting by Anytime Refinement In Theory and Practice of Logic Programming (TPLP), 2024.
    [ BibTeX | pdf  ]
  16. Ivan Blitznets and Markus Hecher Tight Double Exponential Lower Bounds In 18th Annual Conference on Theory and Applications of Models of Computation (TAMC), 2024.
    [ BibTeX ]
  17. Johannes K. Fichte, Geibinger Tobias, Markus Hecher and Matthias Schloegel Parallel Empirical Evaluations: Resilience Despite Concurrency In 38th AAAI Conference on Artificial Intelligence, 2024.
    [ BibTeX ]
  18. Markus Hecher and Rafael Kiesel On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? In 38th AAAI Conference on Artificial Intelligence, 2024.
    [ BibTeX | pdf  ]

2023

  1. Viktor Besin, Markus Hecher and Stefan Woltran On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth In 26th European Conference on Artificial Intelligence (ECAI), 2023.
    [ BibTeX | pdf  ]
  2. Markus Hecher and Rafael Kiesel The Impact of Structure in Answer Set Counting: Fighting Cycles and its Limits In 20th International Conference on Principles of Knowledge Representation and Reasoning (KR), 2023.
    [ BibTeX | pdf  ]
  3. Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood and Arne Meier Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation In 32nd International Joint Conference on Artificial Intelligence (IJCAI), ijcai.org, 2023.
    [ BibTeX | pdf  ]
  4. Jorge Fandinno and Markus Hecher Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs In 32nd International Joint Conference on Artificial Intelligence (IJCAI), ijcai.org, 2023.
    [ BibTeX | pdf  ]
  5. Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky and Sebastian Ordyniak Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF In 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2023.
    [ BibTeX | pdf  ]
  6. Augusto B. Correa, Markus Hecher, Malte Helmert, Davide M. Longo, Florian Pommerening and Stefan Woltran Grounding Planning Tasks Using Tree Decompositions and Iterated Solving In 33rd International Conference on Automated Planning and Scheduling, 2023.
    [ BibTeX | pdf  ]
  7. Johannes K. Fichte, Markus Hecher and Stefan Szeider Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity In 37th AAAI Conference on Artificial Intelligence, 2023.
    [ BibTeX | pdf  ]
  8. Markus Hecher Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth? In 37th AAAI Conference on Artificial Intelligence, 2023.
    [ BibTeX | pdf  ]
  9. Johannes K. Fichte, Markus Hecher, Michael Morak, Patrick Thier and Stefan Woltran Solving Projected Model Counting by Utilizing Treewidth and its Limits In Artif. Intell., 2023.
    [ BibTeX | pdf  ]
  10. Johannes K. Fichte, Markus Hecher, Daniel Le Berre and Stefan Szeider The Silent (R)evolution of SAT In Commun. ACM, 2023.
    [ BibTeX | pdf  ]

2022

  1. Markus Hecher Advanced Tools and Methods for Treewidth-Based Problem Solving IOS Press, Frontiers in Artificial Intelligence and Applications 359, 2022.
    Available at IOS Press
    [ BibTeX | pdf  ]
  2. Johannes K. Fichte, Markus Hecher, Sarah A. Gaggl and Dominik Rusovac IASCAR: Incremental Answer Set Counting by Anytime Refinement In 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR), pages 217-230, 2022.
    [ BibTeX | pdf  ]
  3. Johannes K. Fichte, Markus Hecher and Piotr Gorczyca A Practical Account into Counting Dung's Extensions by Dynamic Programming In 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR), pages 387-400, 2022.
    [ BibTeX | pdf  ]
  4. Johannes K. Fichte, Markus Hecher and Valentin Roland Proofs for Propositional Model Counting In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 30:1-30:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
    [ BibTeX | pdf  ]
  5. Kabir Mohimenul, Flavio Everardo, Ankit K. Shukla, Markus Hecher, Johannes K. Fichte and Kuldeep S. Meel ApproxASP - A Scalable Approximate Answer Set Counter (Extended Abstract) In 35th International Conference on Logic Programming (ICLP), 2022.
    [ BibTeX | pdf  ]
  6. Markus Hecher Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? (Extended Abstract) In 35th International Conference on Logic Programming (ICLP), 2022.
    [ BibTeX | pdf  ]
  7. Johannes Klaus Fichte, Markus Hecher and Mohamed Nadeem Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach In 31st International Joint Conference on Artificial Intelligence (IJCAI), pages 2620-2626, ijcai.org, 2022.
    [ BibTeX | pdf  ]
  8. Viktor Besin, Markus Hecher and Stefan Woltran Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract) In 31st International Joint Conference on Artificial Intelligence (IJCAI), pages 5264-5268, ijcai.org, 2022.
    [ BibTeX | pdf  ]
  9. Viktor Besin, Markus Hecher and Stefan Woltran Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck In 31st International Joint Conference on Artificial Intelligence (IJCAI), pages 2546-2552, ijcai.org, 2022.
    [ BibTeX | pdf  ]
  10. Kabir Mohimenul, Flavio Everardo, Ankit K. Shukla, Markus Hecher, Johannes K. Fichte and Kuldeep S. Meel ApproxASP - A Scalable Approximate Answer Set Counter In 36th AAAI Conference on Artificial Intelligence, pages 5755-5764, 2022.
    [ BibTeX | pdf  ]
  11. Wolfgang Dvorak, Markus Hecher, Matthias Koenig, Andre Schidler, Stefan Szeider and Stefan Woltran Tractable Abstract Argumentation via Backdoor-Treewidth In 36th AAAI Conference on Artificial Intelligence, pages 5608-5615, 2022.
    [ BibTeX | pdf  ]
  12. Markus Hecher Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? In Artif. Intell., 304: 103651, 2022.
    Invited Fast Track Submission.
    [ BibTeX | pdf  ]
  13. Johannes Klaus Fichte, Markus Hecher, Patrick Thier and Stefan Woltran Exploiting Database Systems and Treewidth for Counting In Theory and Practice of Logic Programming (TPLP), 22 (1): 128-157, 2022.
    Invited Submission of PADL'20 (among best papers)
    [ BibTeX | pdf  ]
  14. Johannes Klaus Fichte, Markus Hecher and Irina Schindler Default logic and bounded treewidth In Information and Computation, 283: 104675, 2022.
    [ BibTeX | pdf  | doi  ]

2021

  1. Markus Hecher Advanced tools and methods for treewidth-based problem solving Ph.D. Thesis, Universität Potsdam, 2021.
    [ BibTeX | pdf  ]
  2. Johannes Klaus Fichte, Markus Hecher and Ciaran McCreesh Complications for Computational Experiments from Modern Processors In 27th International Conference on Principles and Practice of Constraint Programming (CP), LIPIcs , pages 25:1-25:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
    [ BibTeX | pdf  ]
  3. Johannes Klaus Fichte, Markus Hecher and Valentin Roland Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization In 27th International Conference on Principles and Practice of Constraint Programming (CP), Volume 210 of LIPIcs, pages 24:1-24:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
    [ BibTeX | pdf  ]
  4. Viktor Besin, Markus Hecher and Stefan Woltran Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs In Theory and Practice of Logic Programming (TPLP), pages 575-592, 2021.
    Winner of the Best Paper and Best Student Paper Award of ICLP'21. Invited for IJCAI 22 Sister Best Paper Track.
    [ BibTeX | pdf  ]
  5. Thomas Eiter, Markus Hecher and Rafael Kiesel Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting In 18th International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 269-279, 2021.
    [ BibTeX | pdf  ]
  6. Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood and Arne Meier Decomposition-Guided Reductions for Argumentation and Treewidth In 30th International Joint Conference on Artificial Intelligence (IJCAI), pages 1880-1886, ijcai.org, 2021.
    [ BibTeX | pdf  ]
  7. Johannes K. Fichte, Florim Hamiti and Markus Hecher The Model Counting Competition 2020 In ACM Journal of Experimental Algorithmics, 26 (1), 2021.
    [ BibTeX | pdf  ]
  8. Johannes K. Fichte, Markus Hecher, Michael Morak and Stefan Woltran DynASP2.5: Dynamic Programming on Tree Decompositions in Action In Algorithms, 14 (3), 2021.
    [ BibTeX | pdf  | doi  ]
  9. Johannes Klaus Fichte, Markus Hecher and Arne Meier Knowledge-Base Degrees of Inconsistency: Complexity and Counting In 35th AAAI Conference on Artificial Intelligence, 2021.
    [ BibTeX | pdf  ]
  10. Jorge Fandinno and Markus Hecher Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard In 35th AAAI Conference on Artificial Intelligence, 2021.
    [ BibTeX | pdf  ]

2020

  1. Markus Hecher Treewidth-Aware Reductions of normal ASP to SAT – Is normal ASP harder than SAT after all? In 4th Workshop on Trends and Applications of Answer Set Programming (TAASP), 2020.
    [ BibTeX ]
  2. Flavio Everardo, Markus Hecher and Ankit Shukla An Approximate Model Counter for Answer Set Programming In 4th Workshop on Trends and Applications of Answer Set Programming (TAASP), 2020.
    [ BibTeX ]
  3. Markus Hecher, Michael Morak and Stefan Woltran Structural Decompositions of Epistemic Logic Programs In 2nd Workshop on Epistemic Extensions of Logic Programming (EELP'20), 2020.
    [ BibTeX ]
  4. Johannes K. Fichte, Markus Hecher and Andre Schiedler Solving the Steiner Tree Problem with few Terminals In 32nd International Conference on Tools with Artificial Intelligence (ICTAI'20), 2020.
    [ BibTeX | pdf  ]
  5. Flavio Everardo, Markus Hecher and Ankit Shukla Extending XORRO with Approximate Model Counting In 13th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP), 2020.
    [ BibTeX ]
  6. Jorge Fandinno and Markus Hecher Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard In 13th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP), 2020.
    [ BibTeX ]
  7. Flavio Everardo, Markus Hecher and Ankit Shukla An Approximate Model Counter for Answer Set Programming In 18th International Workshop on Non-Monotonic Reasoning (NMR), 2020.
    [ BibTeX ]
  8. Jorge Fandinno and Markus Hecher Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard In 18th International Workshop on Non-Monotonic Reasoning (NMR), 2020.
    [ BibTeX ]
  9. Johannes Klaus Fichte and Markus Hecher Counting with Bounded Treewidth: Meta Algorithm and Runtime Guarantees In 18th International Workshop on Non-Monotonic Reasoning (NMR), 2020.
    [ BibTeX ]
  10. Markus Hecher, Johannes Klaus Fichte and Andreas Pfandler Lower Bounds for QBFs of Bounded Treewidth In 17th International Conference on Principles of Knowledge Representation and Reasoning (KR), 2020.
    [ BibTeX | pdf  ]
  11. Johannes Klaus Fichte, Markus Hecher and Maximilian Kieler Treewidth-Aware Quantifier Elimination and Expansion for QCSP In 26th International Conference on Principles and Practice of Constraint Programming (CP), 2020.
    [ BibTeX | pdf  ]
  12. Johannes Klaus Fichte, Markus Hecher and Stefan Szeider A Time Leap Challenge for SAT-Solving In 26th International Conference on Principles and Practice of Constraint Programming (CP), 2020.
    [ BibTeX | pdf  ]
  13. Johannes Klaus Fichte, Markus Hecher and Stefan Szeider Breaking Symmetries with RootClique and LexTopsort In 26th International Conference on Principles and Practice of Constraint Programming (CP), 2020.
    [ BibTeX | pdf  ]
  14. Johannes Klaus Fichte, Markus Hecher, Patrick Thier and Stefan Woltran Exploiting Database Systems and Treewidth for Counting In 1st International Workshop on Model Counting (MCW 2020), co-located with 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT), 2020.
    [ BibTeX ]
  15. Markus Hecher Treewidth-Aware Reductions of normal ASP to SAT – Is normal ASP harder than SAT after all? In 17th International Conference on Principles of Knowledge Representation and Reasoning (KR), 2020.
    [ BibTeX | pdf  ]
  16. Markus Hecher, Patrick Thier and Stefan Woltran Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology In 1st Declarative Problem Solving Workshop (DPSW), co-located with the 24th European Conference on Artificial Intelligence (ECAI), 2020.
    [ BibTeX ]
  17. Markus Hecher, Patrick Thier and Stefan Woltran Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology In 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT), 2020.
    [ BibTeX | pdf  ]
  18. Johannes Klaus Fichte, Markus Hecher and Andreas Pfandler Lower Bounds for QBFs of Bounded Treewidth In 35th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2020.
    [ BibTeX | pdf  ]
  19. Johannes Klaus Fichte, Markus Hecher, Patrick Thier and Stefan Woltran Exploiting Database Systems and Treewidth for Counting In 22nd Symposium on Practical Aspects of Declarative Languages, 2020.
    [ BibTeX | pdf  ]
  20. Markus Hecher, Michael Morak and Stefan Woltran Structural Decompositions of Epistemic Logic Programs In 34th AAAI Conference on Artificial Intelligence, 2020.
    [ BibTeX | pdf  ]

2019

  1. Markus Hecher, Michael Morak and Stefan Woltran Structural Decompositions of Epistemic Logic Programs In 3rd Workshop on Trends and Applications of Answer Set Programming (TAASP), 2019.
    [ BibTeX ]
  2. Muhammad Ayaz Dzulfikar, Johannes Klaus Fichte and Markus Hecher The PACE2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration In 14th International Symposium on Parameterized and Exact Computation (IPEC), 2019.
    [ BibTeX | pdf  ]
  3. Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp and Jakob Rath Inconsistency Proofs for ASP: The ASP-DRUPE Format In 35th International Conference on Logic Programming (ICLP), 2019.
    [ BibTeX | pdf  ]
  4. Johannes Klaus Fichte, Markus Hecher and Markus Zisser gpusat2 - An Improved GPU Model Counter In 25th International Conference on Principles and Practice of Constraint Programming (CP), 2019.
    [ BibTeX | pdf  ]
  5. Johannes Klaus Fichte, Markus Hecher and Andreas Pfandler Untere Schranken fuer quantizierte Boole'sche Formeln mit beschraenkter Baumweite In Gesellschaft fuer Informatik: Fachgruppe Komplexitaet - Newsletter 8, 2019.
    [ BibTeX | pdf  ]
  6. Markus Hecher Answer Set Solving exploiting Treewidth and its Limits In 25th International Conference on Principles and Practice of Constraint Programming Doctoral Program (CP DP), 2019.
    [ BibTeX ]
  7. Johannes Klaus Fichte, Markus Hecher and Markus Zisser gpusat2 - An Improved GPU Model Counter In POS@SAT, 2019.
    [ BibTeX ]
  8. Johannes Klaus Fichte, Markus Hecher, Tobias Philipp and Jakob Rath Inconsistency Proofs for ASP: The ASP-DRUPE Format In ASPOCP@LPNMR, 2019.
    [ BibTeX ]
  9. Markus Hecher Answer Set Solving exploiting Treewidth and its Limits In 15th International Conference on Logic Programming and Nonmonotonic Reasoning Doctoral Consortium (LPNMR DC), 2019.
    [ BibTeX ]
  10. Johannes Klaus Fichte and Markus Hecher Treewidth and Counting Projected Answer Sets In 15th International Conference on Logic Programming and Nonmonotonic Reasoning, 2019.
    [ BibTeX ]
  11. Johannes Klaus Fichte, Markus Hecher and Arne Meier Counting Complexity for Reasoning in Abstract Argumentation In 33rd AAAI Conference on Artificial Intelligence, 2019.
    [ BibTeX | pdf  ]

2018

  1. Johannes Klaus Fichte and Markus Hecher ASP and Projected Counting Meets Bounded Treewidth In 2nd Workshop on Trends and Applications of Answer Set Programming (TAASP), 2018.
    [ BibTeX ]
  2. Johannes Klaus Fichte and Markus Hecher Exploiting Treewidth for Counting Projected Answer Sets In 17th International Workshop on Non-Monotonic Reasoning (NMR), 2018.
    [ BibTeX ]
  3. Markus Hecher Answer Set Solving with Bounded Treewidth In 16th International Conference on Principles of Knowledge Representation and Reasoning Doctoral Consortium (KR DC), 2018.
    [ BibTeX ]
  4. Johannes Klaus Fichte and Markus Hecher Exploiting Treewidth for Counting Projected Answer Sets In 16th International Conference on Principles of Knowledge Representation and Reasoning (KR), 2018.
    [ BibTeX | pdf  ]
  5. Johannes Klaus Fichte, Markus Hecher, Stefan Woltran and Markus Zisser Weighted Model Counting on the GPU by Exploiting Small Treewidth In 26th Annual European Symposium on Algorithms (ESA), 2018.
    [ BibTeX | pdf  ]
  6. Johannes Klaus Fichte, Markus Hecher, Neha Lodha and Stefan Szeider An SMT Approach to Fractional Hypertree Width In Workshop on Tractable Probabilistic Models (TPM), 2018.
    [ BibTeX ]
  7. Johannes Klaus Fichte, Markus Hecher, Neha Lodha and Stefan Szeider An SMT Approach to Fractional Hypertree Width In 24th International Conference on Principles and Practice of Constraint Programming (CP), 2018.
    [ BibTeX | pdf  ]
  8. Johannes Klaus Fichte, Markus Hecher, Michael Morak and Stefan Woltran Exploiting Treewidth for Projected Model Counting and its Limits In 21st International Conference on Theory and Applications of Satisfiability Testing (SAT), 2018.
    [ BibTeX | pdf  ]
  9. Johannes Klaus Fichte, Markus Hecher and Irina Schindler Default Logic and Bounded Treewidth In Twelfth International Conference on Language and Automata Theory and Applications (LATA), 2018.
    [ BibTeX | pdf  ]
  10. Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan and Stefan Woltran Dynamic Programming on Tree Decompositions with D-FLAT In KI - Künstliche Intelligenz, 2018.
    [ BibTeX | pdf  ]

2017

  1. Johannes Klaus Fichte, Markus Hecher, Michael Morak and Stefan Woltran DynASP2.5: Dynamic Programming on Tree Decompositions in Action In Twelfth International Symposium on Parameterized and Exact Computation (IPEC), 2017.
    [ BibTeX | pdf  ]
  2. Markus Hecher Structure-Driven Answer-Set Solving In Fourteenth International Conference on Logic Programming and Nonmonotonic Reasoning Doctoral Consortium (LPNMR DC), 2017.
    [ BibTeX ]
  3. Johannes Klaus Fichte, Markus Hecher, Michael Morak and Stefan Woltran Answer Set Solving with Bounded Treewidth Revisited In Fourteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 2017.
    [ BibTeX | pdf  ]

2016

  1. Johannes Klaus Fichte, Markus Hecher, Michael Morak and Stefan Woltran Answer Set Solving using Tree Decompositions and Dynamic Programming - The DynASP2 System - Technical Report DBAI-TR-2016-101, DBAI, TU Wien, 2016.
    [ BibTeX | pdf  ]
  2. Johannes Klaus Fichte, Markus Hecher, Michael Morak and Stefan Woltran Counting Answer Sets via Dynamic Programming In Trends and Applications of Answer Set Programming (KI 2016), 2016.
    [ BibTeX ]
  3. Bernhard Bliem, Günther Charwat, Markus Hecher and Stefan Woltran D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy In Fundamenta Informaticae special issue of ASPOCP 2015, 2016.
    [ BibTeX ]
  4. Bernhard Bliem, Markus Hecher and Stefan Woltran On Efficiently Enumerating Semi-stable Extensions via Dynamic Programming on Tree Decompositions In Sixth International Conference on Computational Models of Argument (COMMA 2016), 2016.
    [ BibTeX | pdf  ]
  5. Bernhard Bliem, Günther Charwat, Markus Hecher and Stefan Woltran Subset Minimization in Dynamic Programming on Tree Decompositions In Thirtieth AAAI Conference on Artificial Intelligence (Workshop on Beyond NP 2016), 2016.
    [ BibTeX ]

2015

  1. Bernhard Bliem, Günther Charwat, Markus Hecher and Stefan Woltran D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy Technical Report DBAI-TR-2015-93, DBAI, TU Wien, 2015.
    [ Abstract | BibTeX | pdf  ]
  2. Bernhard Bliem, Günther Charwat, Markus Hecher and Stefan Woltran D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy In Eighth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2015), 2015.
    [ BibTeX ]
  3. Markus Hecher Optimizing Second-Level Dynamic Programming Algorithms; The D-FLAT^2 System: Encodings and Experimental Evaluation Master's Thesis, Vienna University of Technology, 2015.
    Stefan Woltran and Bernhard Bliem advisors.
    [ BibTeX | pdf  ]

2014

  1. Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher and Stefan Woltran The D-FLAT System for Dynamic Programming on Tree Decompositions In Fourteenth European Conference on Logics in Artificial Intelligence (JELIA 2014), Volume 8761 of LNCS, pages 558-572, Springer, 2014.
    [ Abstract | BibTeX | pdf  | system page  ]
  2. Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher and Stefan Woltran The D-FLAT System for Dynamic Programming on Tree Decompositions In Fourth International Workshop on Logic and Search (LaSh 2014), 2014.
    [ Abstract | BibTeX | pdf  | system page  ]
  3. Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher and Stefan Woltran D-FLAT: Progress Report Technical Report DBAI-TR-2014-86, DBAI, Vienna University of Technology, 2014.
    [ Abstract | BibTeX | pdf  ]

Home / Kontakt / Webmaster / Offenlegung gemäß § 25 Mediengesetz: Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. Disclaimer / Datenschutzerklärung