| Answer set solving with bounded treewidth revisited JK Fichte, M Hecher, M Morak, S Woltran International Conference on Logic Programming and Nonmonotonic Reasoning …, 2017 | 51 | 2017 |
| Guarded-based disjunctive tuple-generating dependencies P Bourhis, M Manna, M Morak, A Pieris ACM Transactions on Database Systems (TODS) 41 (4), 1-45, 2016 | 50 | 2016 |
| The impact of disjunction on query answering under guarded-based existential rules P Bourhis, M Morak, A Pieris Twenty-Third International Joint Conference on Artificial Intelligence, 2013 | 39 | 2013 |
| Exploiting treewidth for projected model counting and its limits JK Fichte, M Hecher, M Morak, S Woltran Theory and Applications of Satisfiability Testing–SAT 2018: 21st …, 2018 | 36 | 2018 |
| lpopt: A Rule Optimization Tool for Answer Set Programming M Bichler, M Morak, S Woltran Fundamenta Informaticae 177 (3-4), 275-296, 2020 | 35 | 2020 |
| lpopt: A rule optimization tool for answer set programming M Bichler, M Morak, S Woltran Logic-Based Program Synthesis and Transformation: 26th International …, 2017 | 35 | 2017 |
| On the complexity of ontological reasoning under disjunctive existential rules G Gottlob, M Manna, M Morak, A Pieris Mathematical Foundations of Computer Science 2012: 37th International …, 2012 | 32 | 2012 |
| DynASP2. 5: Dynamic programming on tree decompositions in action JK Fichte, M Hecher, M Morak, S Woltran Algorithms 14 (3), 81, 2021 | 24 | 2021 |
| D-FLAT: Declarative problem solving using tree decompositions and answer-set programming B Bliem, M Morak, S Woltran Theory and practice of Logic Programming 12 (4-5), 445-464, 2012 | 24 | 2012 |
| dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation W Dvořák, M Morak, C Nopp, S Woltran International Conference on Applications of Declarative Programming and …, 2011 | 22 | 2011 |
| Stable model semantics for tuple-generating dependencies revisited M Alviano, M Morak, A Pieris Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2017 | 21 | 2017 |
| A dynamic-programming based ASP-solver M Morak, R Pichler, S Rümmele, S Woltran Logics in Artificial Intelligence: 12th European Conference, JELIA 2010 …, 2010 | 21 | 2010 |
| Single-Shot Epistemic Logic Program Solving. M Bichler, M Morak, S Woltran IJCAI 18, 1714-1720, 2018 | 18 | 2018 |
| The Impact of Treewidth on ASP Grounding and Solving. B Bliem, M Moldovan, M Morak, S Woltran IJCAI 17, 852-858, 2017 | 18 | 2017 |
| Preprocessing of Complex Non-Ground Rules in Answer Set Programming M Morak, S Woltran | 18 | 2012 |
| Structural decompositions of epistemic logic programs M Hecher, M Morak, S Woltran Proceedings of the AAAI Conference on Artificial Intelligence 34 (03), 2830-2837, 2020 | 17 | 2020 |
| The power of non-ground rules in answer set programming M Bichler, M Morak, S Woltran Theory and Practice of Logic Programming 16 (5-6), 552-569, 2016 | 17 | 2016 |
| The impact of treewidth on grounding and solving of answer set programs B Bliem, M Morak, M Moldovan, S Woltran Journal of Artificial Intelligence Research 67, 35-80, 2020 | 14 | 2020 |
| Making cross products and guarded ontology languages compatible P Bourhis, M Morak, A Pieris 26th International Joint Conference on Artificial Intelligence, 880-886, 2017 | 14 | 2017 |
| Evaluating tree-decomposition based algorithms for answer set programming M Morak, N Musliu, R Pichler, S Rümmele, S Woltran Learning and Intelligent Optimization: 6th International Conference, LION 6 …, 2012 | 14 | 2012 |
