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 |
 |
|---|---|---|
| [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
- Recently, I received an FWF Erwin Schrödinger grant for "QuantASP", where I have been proposing a 3-year project on novel ideas for quantitative reasoning via logic programming. Thereby, I will carry out two years of research at MIT, MA, USA in the group of Erik Demaine.
- Simons-Berkeley Research Fellowship for participation in the program Logic and Algorithms in Database Theory and AI
- Heidelberg Laureate Forum Accommodation and Travel Grant for participation in the prestigious 10th Heidelberg Laureate Forum 2023 (HLF 2023)
- Research Excellence Scholarship for a foreign research stay, awarded by the province of Lower Austria
- alpha+ Rückenwind Funding Bonus for strengthening connections with international colleagues and attending conferences, awarded by alpha+
- Member of the ASciNA Mentoring Program 2022/2023 Mentor: Florian Lonsing
- Stipend for outstanding (under)graduate performance, awarded by TU Wien (every semester of the years 2010-2015; Bachelor's GPA 1.3, Master's GPA 1.0)
- Student travel grants to participate in SAT 2018 and FLOC 2018.
- Travel grant awarded by the Potsdam graduate school to participate in KR 2018.
Offered Positions
- Shortlisted for a Professor position in Computer Science (2022, remote interview, position canceled) at University of Omaha, NE, United States
- Shortlisted for a Professor position in Computer Science (2023, in-person interview, tenure track, theory group) at TU Eindhoven, Netherlands
- Shortlisted for a W2 full Professor position in Computer Science (2024, in-person interview, graph theory and algorithms) at TU Dresden, Germany
- Offered a 3-year PostDoc position in Neuro-symbolic Learning & Reasoning (2023) at Monash University
- Offered a Professor position in Computer Science (2024, remote interview, tenure track, theory group, invited for in-person interview) at Leiden University, Netherlands
- Offered a CNRS CRCN position, ranked first in CNRS competition (2024, young researcher life-time research position, grant proposal and oral exam, 150 applicants) at CRIL (Lens) and University of Bordeaux, France
- Offered an INRIA CRCN position, ranked first in INRIA competition (2024, University of Cote D'Azur, young researcher life-time research position, grant proposal and oral exam) at LIRMM, Montpellier, France
- Offered a Professor position in Computer Science (2024, remote and in-person interview, tenure track, theory group) at University of Lund, Sweden
Invited Talks
- Invited Talk at the 40th International Conference on Logic Programming (ICLP 2024) in Dellas (TX), United States.
Awards
- First Winner of the KR Early Career Award (2022); mentioned in the preface of the KR 2022 proceedings
- First Austrian Winner of the EurAI Dissertation Award (2021); reported by TU Wien Informatics and University of Potsdam
- (Co-)Winner of the GI Dissertation Award 2021; reported by TU Wien informatics, TU Wien, and Gesellschaft für Informatik (GI), awarded by the German (GI), Swiss (SI), and Austrian (OCG) societies of informatics
- Awarded with the Award of Excellence 2021 for an outstanding PhD thesis by the Austrian ministry of education, science, and research (BMBWF); reported by TU Wien Informatics
- Runner-Up (top 4 finalists) for the E.W. Beth Outstanding Dissertation Prize 2022 by FoLLi
- Runner-Up (top 3 finalists) for the Heinz Zemanek Award 2020-2022 by OCG Austria
- Nominated for the AAAI/ACM SIGAI Doctoral Dissertation Award by TU Wien
- Awarded with the Viennese prize for an outstanding master's thesis (Würdigungspreis der Stadt Wien) in 2016
- Runner-Up (top 3 finalists) for the Epilog Distinguished Young Alumnus Award in 2016
- Winner of the golden honor pin for outstanding performance at HTL Wiener Neustadt (high school years 2004-2009; GPAs 1.0)
- Winner of the Marco Cadoli Best Student Paper Award at KR 2020; reported by TU Wien (+ invited AIJ journal submission)
- Co-Winner of the Best Paper Award and Best Student Paper Award at ICLP 2021 (+ invited submission for IJCAI 2022 Sister Best Paper track)
- Co-Winner of the Best Paper Award at IEEE ICTAI 2024
- Honorable Mention (runner-up for best student paper award) at ICAPS 2023
- Honorable Mention (finalist for best paper award) at LPNMR 2022; reported by TU Dresden
- Co-Runner-Up for the best paper award at LPNMR 2019
- Co-Winner with two solvers of the satisficing track at the International Planning Competition 2023 (IPC 2023)
- Co-Winner of the International Competition on Graph Counting Algorithms 2024 (ICGCA 2024)
- Co-Winner of the International Competition on Graph Counting Algorithms 2023 (ICGCA 2023)
- Co-Winner of two tracks at the International Competition on Computational Models of Argumentation (ICCMA) 2021
- Co-Winner of being among best papers at PADL 2020 (+ invited journal submission)
- Co-Winner of the LP/CP Programming Contest 2018
- Co-4th place of the PACE Challenge 2018
Organized Competitions and Workshops
- Web chair of IJCAI 2022
- Co-Organizer of the PACE Challenge 2019
- Co-Organizer of the 11th Workshop on Probabilistic Logic Programming (PLP) 2024
- Co-Organizer of the First Model Counting Competition 2020
- Co-Organizer of the Model Counting Competition 2021
- Co-Organizer of the Model Counting Competition 2022
- Co-Organizer of the Model Counting Competition 2023
- Co-Organizer of the Model Counting Competition 2024
- Co-Organizer of the First Model Counting Workshop 2020
- Co-Organizer of the Workshop on Counting and Sampling 2021
- Co-Organizer of the Workshop on Counting and Sampling 2022
- Co-Organizer of the Workshop on Counting and Sampling 2023
- Co-Organizer of ASPOCP 2020
- Co-Organizer of ASPOCP 2021
- Co-Organizer of ASPOCP 2022
- Co-Organizer of TAASP 2018
Steering Committee Member
- Member of the PACE Challenge Steering Committee2019-2023
- Member of the Workshop on Counting and Sampling 2024 Steering Committee
Reviewing
- Member of (Senior) Program Committees for several editions of prestigious conferences in AI, as for example AAAI, IJCAI, KR, ICLP, ECAI, JELIA, and the like
- Reviewing and Subreviewing for international conferences like SODA, ICALP, STACS, ALENEX, MFCS, Euro-Par, AAAI, IJCAI, ECAI, KR, ICLP, SAT, CP, LPNMR, COMMA, and the like
- Reviewing for journals in AI (AIJ, JAIR, AMAI, JLC, TPLP)
Volunteering
- VSL / FLOC 2014
- ALGO 2017
- LPNMR 2017
- FLOC 2018
- KR 2018
- Several editions of AAAI: AAAI 2018, 2019, 2020
- Active member of the local fire department ;)
Teaching
- Tutoring for many different undergraduate and graduate courses ranging from, e.g., system programming, operating systems development, software engineering, knowledge representation and reasoning, (advanced) internet security and the like
- Teaching assistant for master courses in knowledge representation and reasoning
- Advisor assistant in 9 bachelor's and master's theses
- 3 ECTS Logic Seminar (recurring)
- 6 ECTS Project in Computer Science 1 & 2 (recurring)
(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).
- 5 Bachleor's theses: Maximilian F. Kieler (TU Dresden, Germany), Viktor Besin, Katharina Sommer, Kaan Unalan, Alexander Beiser
- 4 Master's theses: Markus Zisser, Andre Schidler, Valentin Roland, Viktor Besin
Publications
See also: DBLPSelected Representative Works
- 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.
- Markus Hecher. Treewidth-Aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All?, Artificial Intelligence, 304: 103651, 2022.
- 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), 2022.
- Max Bannach and Markus Hecher. Structure-Guided Automated Reasoning, In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS) 2025.
- 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 35th International Symposium on Algorithms and Computation (ISAAC), 2024.
- 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.
- 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 30th International Conference on DNA Computing and Molecular Programming (DNA 30), 2024.
- Johannes Klaus Fichte, Markus Hecher, Daniel Le Berre and Stefan Szeider. The Silent (R)evolution of SAT , Commun. ACM, 2023.
- Johannes Klaus Fichte, Florim Hamiti and Markus Hecher. The Model Counting Competition 2020 , ACM Journal of Experimental Algorithmics 2021.
- 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 (ICAPS), 2023.
2025
- Structure-Guided Automated Reasoning In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS), 2025.
[ BibTeX ] - Counting and Reasoning with Plans In 39th AAAI Conference on Artificial Intelligence (AAAI), 2025.
[ BibTeX ] - Dung’s Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases In 39th AAAI Conference on Artificial Intelligence (AAAI), 2025.
[ BibTeX ]
2024
- 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 ] - 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 ] - Domain-Based Nucleic-Acid Minimum Free Energy: Algorithmic Hardness and Parameterized Bounds In The 30th International Conference on DNA Computing and Molecular Programming (DNA 30), 2024.
[ BibTeX ] - 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 ] - Counting Complexity for Reasoning in Abstract Argumentation In J. Artif. Intell. Research, 2024.
[ BibTeX ] - Rejection in Abstract Argumentation: Harder Than Acceptance? In 27th European Conference on Artificial Intelligence (ECAI), 2024.
[ BibTeX ] - Epistemic Logic Programs: Non-Ground and Counting Complexity In 33rd International Joint Conference on Artificial Intelligence (IJCAI), ijcai.org, 2024.
[ BibTeX ] - Finite Groundings for ASP with Functions: A Journey through Consistency In 33rd International Joint Conference on Artificial Intelligence (IJCAI), ijcai.org, 2024.
[ BibTeX ] - Quantitative Claim-Centric Reasoning in Logic-Based Argumentation In 33rd International Joint Conference on Artificial Intelligence (IJCAI), ijcai.org, 2024.
[ BibTeX ] - Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting In 33rd International Joint Conference on Artificial Intelligence (IJCAI), ijcai.org, 2024.
[ BibTeX ] - On Weighted Maximum Model Counting: Complexity and Fragments In 36th International Conference on Tools with Artificial Intelligence (ICTAI), 2024.
[ BibTeX ] - Forgetting in Counting and Bounded Treewidth In 36th International Conference on Tools with Artificial Intelligence (ICTAI), 2024.
[ BibTeX ] - Structure-guided Cube-and-conquer for MaxSAT In 16th NASA Formal Methods Symposium (NFM), 2024.
[ BibTeX ] - Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting In Artif. Intell., 2024.
[ BibTeX | pdf ] - IASCAR: Incremental Answer Set Counting by Anytime Refinement In Theory and Practice of Logic Programming (TPLP), 2024.
[ BibTeX | pdf ] - Tight Double Exponential Lower Bounds In 18th Annual Conference on Theory and Applications of Models of Computation (TAMC), 2024.
[ BibTeX ] - Parallel Empirical Evaluations: Resilience Despite Concurrency In 38th AAAI Conference on Artificial Intelligence (AAAI), 2024.
[ BibTeX ] - On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? In 38th AAAI Conference on Artificial Intelligence (AAAI), 2024.
[ BibTeX | pdf ]
2023
- 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 ] - 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 ] - Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation In 32nd International Joint Conference on Artificial Intelligence (IJCAI), ijcai.org, 2023.
[ BibTeX | pdf ] - Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs In 32nd International Joint Conference on Artificial Intelligence (IJCAI), ijcai.org, 2023.
[ BibTeX | pdf ] - 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 ] - Grounding Planning Tasks Using Tree Decompositions and Iterated Solving In 33rd International Conference on Automated Planning and Scheduling (ICAPS), 2023.
[ BibTeX | pdf ] - Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity In 37th AAAI Conference on Artificial Intelligence (AAAI), 2023.
[ BibTeX | pdf ] - Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth? In 37th AAAI Conference on Artificial Intelligence (AAAI), 2023.
[ BibTeX | pdf ] - Solving Projected Model Counting by Utilizing Treewidth and its Limits In Artif. Intell., 2023.
[ BibTeX | pdf ] - The Silent (R)evolution of SAT In Commun. ACM, 2023.
[ BibTeX | pdf ]
2022
- 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 ] - 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 ] - 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 ] - 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 ] - ApproxASP - A Scalable Approximate Answer Set Counter (Extended Abstract) In 35th International Conference on Logic Programming (ICLP), 2022.
[ BibTeX | pdf ] - 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 ] - 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 ] - 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 ] - 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 ] - ApproxASP - A Scalable Approximate Answer Set Counter In 36th AAAI Conference on Artificial Intelligence (AAAI), pages 5755-5764, 2022.
[ BibTeX | pdf ] - Tractable Abstract Argumentation via Backdoor-Treewidth In 36th AAAI Conference on Artificial Intelligence (AAAI), pages 5608-5615, 2022.
[ BibTeX | pdf ] - 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 ] - 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 ] - Default logic and bounded treewidth In Information and Computation, 283: 104675, 2022.
[ BibTeX | pdf | doi ]
2021
- Advanced tools and methods for treewidth-based problem solving Ph.D. Thesis, Universität Potsdam, 2021.
[ BibTeX | pdf ] - 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 ] - 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 ] - 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 ] - 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 ] - Decomposition-Guided Reductions for Argumentation and Treewidth In 30th International Joint Conference on Artificial Intelligence (IJCAI), pages 1880-1886, ijcai.org, 2021.
[ BibTeX | pdf ] - The Model Counting Competition 2020 In ACM Journal of Experimental Algorithmics, 26 (1), 2021.
[ BibTeX | pdf ] - DynASP2.5: Dynamic Programming on Tree Decompositions in Action In Algorithms, 14 (3), 2021.
[ BibTeX | pdf | doi ] - Knowledge-Base Degrees of Inconsistency: Complexity and Counting In 35th AAAI Conference on Artificial Intelligence (AAAI), 2021.
[ BibTeX | pdf ] - Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard In 35th AAAI Conference on Artificial Intelligence (AAAI), 2021.
[ BibTeX | pdf ]
2020
- 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 ] - An Approximate Model Counter for Answer Set Programming In 4th Workshop on Trends and Applications of Answer Set Programming (TAASP), 2020.
[ BibTeX ] - Structural Decompositions of Epistemic Logic Programs In 2nd Workshop on Epistemic Extensions of Logic Programming (EELP'20), 2020.
[ BibTeX ] - Solving the Steiner Tree Problem with few Terminals In 32nd International Conference on Tools with Artificial Intelligence (ICTAI'20), 2020.
[ BibTeX | pdf ] - Extending XORRO with Approximate Model Counting In 13th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP), 2020.
[ BibTeX ] - 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 ] - An Approximate Model Counter for Answer Set Programming In 18th International Workshop on Non-Monotonic Reasoning (NMR), 2020.
[ BibTeX ] - Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard In 18th International Workshop on Non-Monotonic Reasoning (NMR), 2020.
[ BibTeX ] - Counting with Bounded Treewidth: Meta Algorithm and Runtime Guarantees In 18th International Workshop on Non-Monotonic Reasoning (NMR), 2020.
[ BibTeX ] - Lower Bounds for QBFs of Bounded Treewidth In 17th International Conference on Principles of Knowledge Representation and Reasoning (KR), 2020.
[ BibTeX | pdf ] - Treewidth-Aware Quantifier Elimination and Expansion for QCSP In 26th International Conference on Principles and Practice of Constraint Programming (CP), 2020.
[ BibTeX | pdf ] - A Time Leap Challenge for SAT-Solving In 26th International Conference on Principles and Practice of Constraint Programming (CP), 2020.
[ BibTeX | pdf ] - Breaking Symmetries with RootClique and LexTopsort In 26th International Conference on Principles and Practice of Constraint Programming (CP), 2020.
[ BibTeX | pdf ] - 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 ] - 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 ] - 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 ] - 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 ] - Lower Bounds for QBFs of Bounded Treewidth In 35th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2020.
[ BibTeX | pdf ] - Exploiting Database Systems and Treewidth for Counting In 22nd Symposium on Practical Aspects of Declarative Languages, 2020.
[ BibTeX | pdf ] - Structural Decompositions of Epistemic Logic Programs In 34th AAAI Conference on Artificial Intelligence (AAAI), 2020.
[ BibTeX | pdf ]
2019
- Structural Decompositions of Epistemic Logic Programs In 3rd Workshop on Trends and Applications of Answer Set Programming (TAASP), 2019.
[ BibTeX ] - The PACE2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration In 14th International Symposium on Parameterized and Exact Computation (IPEC), 2019.
[ BibTeX | pdf ] - Inconsistency Proofs for ASP: The ASP-DRUPE Format In 35th International Conference on Logic Programming (ICLP), 2019.
[ BibTeX | pdf ] - gpusat2 - An Improved GPU Model Counter In 25th International Conference on Principles and Practice of Constraint Programming (CP), 2019.
[ BibTeX | pdf ] - Untere Schranken fuer quantizierte Boole'sche Formeln mit beschraenkter Baumweite In Gesellschaft fuer Informatik: Fachgruppe Komplexitaet - Newsletter 8, 2019.
[ BibTeX | pdf ] - 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 ] - gpusat2 - An Improved GPU Model Counter In POS@SAT, 2019.
[ BibTeX ] - Inconsistency Proofs for ASP: The ASP-DRUPE Format In ASPOCP@LPNMR, 2019.
[ BibTeX ] - Answer Set Solving exploiting Treewidth and its Limits In 15th International Conference on Logic Programming and Nonmonotonic Reasoning Doctoral Consortium (LPNMR DC), 2019.
[ BibTeX ] - Treewidth and Counting Projected Answer Sets In 15th International Conference on Logic Programming and Nonmonotonic Reasoning, 2019.
[ BibTeX ] - Counting Complexity for Reasoning in Abstract Argumentation In 33rd AAAI Conference on Artificial Intelligence (AAAI), 2019.
[ BibTeX | pdf ]
2018
- ASP and Projected Counting Meets Bounded Treewidth In 2nd Workshop on Trends and Applications of Answer Set Programming (TAASP), 2018.
[ BibTeX ] - Exploiting Treewidth for Counting Projected Answer Sets In 17th International Workshop on Non-Monotonic Reasoning (NMR), 2018.
[ BibTeX ] - Answer Set Solving with Bounded Treewidth In 16th International Conference on Principles of Knowledge Representation and Reasoning Doctoral Consortium (KR DC), 2018.
[ BibTeX ] - Exploiting Treewidth for Counting Projected Answer Sets In 16th International Conference on Principles of Knowledge Representation and Reasoning (KR), 2018.
[ BibTeX | pdf ] - Weighted Model Counting on the GPU by Exploiting Small Treewidth In 26th Annual European Symposium on Algorithms (ESA), 2018.
[ BibTeX | pdf ] - An SMT Approach to Fractional Hypertree Width In Workshop on Tractable Probabilistic Models (TPM), 2018.
[ BibTeX ] - An SMT Approach to Fractional Hypertree Width In 24th International Conference on Principles and Practice of Constraint Programming (CP), 2018.
[ BibTeX | pdf ] - Exploiting Treewidth for Projected Model Counting and its Limits In 21st International Conference on Theory and Applications of Satisfiability Testing (SAT), 2018.
[ BibTeX | pdf ] - Default Logic and Bounded Treewidth In Twelfth International Conference on Language and Automata Theory and Applications (LATA), 2018.
[ BibTeX | pdf ] - Dynamic Programming on Tree Decompositions with D-FLAT In KI - Künstliche Intelligenz, 2018.
[ BibTeX | pdf ]
2017
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action In Twelfth International Symposium on Parameterized and Exact Computation (IPEC), 2017.
[ BibTeX | pdf ] - Structure-Driven Answer-Set Solving In Fourteenth International Conference on Logic Programming and Nonmonotonic Reasoning Doctoral Consortium (LPNMR DC), 2017.
[ BibTeX ] - Answer Set Solving with Bounded Treewidth Revisited In Fourteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 2017.
[ BibTeX | pdf ]
2016
- Answer Set Solving using Tree Decompositions and Dynamic Programming - The DynASP2 System - Technical Report DBAI-TR-2016-101, DBAI, TU Wien, 2016.
[ BibTeX | pdf ] - Counting Answer Sets via Dynamic Programming In Trends and Applications of Answer Set Programming (KI 2016), 2016.
[ BibTeX ] - D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy In Fundamenta Informaticae special issue of ASPOCP 2015, 2016.
[ BibTeX ] - 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 ] - Subset Minimization in Dynamic Programming on Tree Decompositions In Thirtieth AAAI Conference on Artificial Intelligence (Workshop on Beyond NP 2016), 2016.
[ BibTeX ]
2015
- 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 ] - 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 ] - 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
- 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 ] - 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 ] - D-FLAT: Progress Report Technical Report DBAI-TR-2014-86, DBAI, Vienna University of Technology, 2014.
[ Abstract | BibTeX | pdf ]