| 2026 | SAC | Logic-based Languages For Solving Reversibility in Planning. | Wolfgang Faber, Michael Morak |
| 2025 | JELIA | Encoding Action Reversibility In Planning Using Quantified ASP and Bule. | Wolfgang Faber, Michael Morak |
| 2025 | KR | Non-deterministic Action Reversibility: Complexity Results. | Jakub Med, Michael Morak, Luks Chrpa, Wolfgang Faber |
| 2024 | ICAPS | Weak and Strong Reversibility of Non-deterministic Actions: Universality and Uniformity. | Jakub Med, Luks Chrpa, Michael Morak, Wolfgang Faber |
| 2023 | AAAI | Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers. | Wolfgang Faber, Michael Morak |
| 2023 | PODS | Generative Datalog with Stable Negation. | Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris |
| 2022 | LPNMR | Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers. | Wolfgang Faber, Michael Morak |
| 2022 | PADL | Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers. | Wolfgang Faber, Michael Morak, Luks Chrpa |
| 2021 | KR | Universal and Uniform Action Reversibility. | Luks Chrpa, Wolfgang Faber, Michael Morak |
| 2021 | KR | Sticky Existential Rules and Disjunction are Incompatible. | Michael Morak |
| 2020 | AAAI | Structural Decompositions of Epistemic Logic Programs. | Markus Hecher, Michael Morak, Stefan Woltran |
| 2020 | ICLP | Determining Action Reversibility in STRIPS Using Epistemic Logic Programs. | Wolfgang Faber, Michael Morak |
| 2020 | ICLP | Determining Action Reversibility in STRIPS Using Answer Set Programming. | Luks Chrpa, Wolfgang Faber, Daniel Fiser, Michael Morak |
| 2020 | ICLP | Structural Decompositions of Epistemic Logic Programs. | Markus Hecher, Michael Morak, Stefan Woltran |
| 2020 | KR | On the Reversibility of Actions in Planning. | Michael Morak, Luks Chrpa, Wolfgang Faber, Daniel Fiser |
| 2019 | AAAI | Strong Equivalence for Epistemic Logic Programs Made Easy. | Wolfgang Faber, Michael Morak, Stefan Woltran |
| 2018 | IJCAI | Single-Shot Epistemic Logic Program Solving. | Manuel Bichler, Michael Morak, Stefan Woltran |
| 2018 | SAT | Exploiting Treewidth for Projected Model Counting and Its Limits. | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
| 2017 | IJCAI | The Impact of Treewidth on ASP Grounding and Solving. | Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran |
| 2017 | IJCAI | Making Cross Products and Guarded Ontology Languages Compatible. | Pierre Bourhis, Michael Morak, Andreas Pieris |
| 2017 | LPNMR | Answer Set Solving with Bounded Treewidth Revisited. | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
| 2017 | PODS | Stable Model Semantics for Tuple-Generating Dependencies Revisited. | Mario Alviano, Michael Morak, Andreas Pieris |
| 2016 | LOPSTR | lpopt: A Rule Optimization Tool for Answer Set Programming. | Manuel Bichler, Michael Morak, Stefan Woltran |
| 2014 | MFCS | Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules. | Pierre Bourhis, Michael Morak, Andreas Pieris |
| 2013 | IJCAI | The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules. | Pierre Bourhis, Michael Morak, Andreas Pieris |
| 2012 | ICLP | Preprocessing of Complex Non-Ground Rules in Answer Set Programming. | Michael Morak, Stefan Woltran |
| 2012 | MFCS | On the Complexity of Ontological Reasoning under Disjunctive Existential Rules. | Georg Gottlob, Marco Manna, Michael Morak, Andreas Pieris |
| 2011 | ICTAI | A New Tree-Decomposition Based Algorithm for Answer Set Programming. | Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2010 | JELIA | A Dynamic-Programming Based ASP-Solver. | Michael Morak, Reinhard Pichler, Stefan Rmmele, Stefan Woltran |