Michael Morak : Publications
Journal papers
-
[1]
D−FLAT: Declarative problem solving using tree decompositions and answer−set programming
Bernhard Bliem‚ Michael Morak and Stefan Woltran
In TPLP. Vol. 12. No. 4−5. Pages 445–464. 2012.
Details about D−FLAT: Declarative problem solving using tree decompositions and answer−set programming | BibTeX data for D−FLAT: Declarative problem solving using tree decompositions and answer−set programming | DOI (10.1017/S1471068412000129) | Link to D−FLAT: Declarative problem solving using tree decompositions and answer−set programming
Conference papers
-
[1]
Towards Efficient Reasoning Under Guarded−Based Disjunctive Existential Rules
Pierre Bourhis‚ Michael Morak and Andreas Pieris
In Erzsébet Csuhaj−Varjú‚ Martin Dietzfelbinger and Zoltán Έsik, editors, Mathematical Foundations of Computer Science 2014 − 39th International Symposium‚ MFCS 2014‚ Budapest‚ Hungary‚ August 25−29‚ 2014. Proceedings‚ Part I. Vol. 8634 of Lecture Notes in Computer Science. Pages 99–110. Springer. 2014.
Details about Towards Efficient Reasoning Under Guarded−Based Disjunctive Existential Rules | BibTeX data for Towards Efficient Reasoning Under Guarded−Based Disjunctive Existential Rules | DOI (10.1007/978-3-662-44522-8) | Link to Towards Efficient Reasoning Under Guarded−Based Disjunctive Existential Rules
-
[2]
Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs
Pierre Bourhis‚ Michael Morak and Andreas Pieris
In Meghyn Bienvenu‚ Magdalena Ortiz‚ Riccardo Rosati and Mantas Simkus, editors, Informal Proceedings of the 27th International Workshop on Description Logics‚ Vienna‚ Austria‚ July 17−20‚ 2014. Vol. 1193 of CEUR Workshop Proceedings. Pages 100–111. CEUR−WS.org. 2014.
Details about Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs | BibTeX data for Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs | Link to Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs
-
[3]
dynPARTIX − A Dynamic Programming Reasoner for Abstract Argumentation
Wolfgang Dvorák‚ Michael Morak‚ Clemens Nopp and Stefan Woltran
In Hans Tompits‚ Salvador Abreu‚ Johannes Oetsch‚ Jörg Pührer‚ Dietmar Seipel‚ Masanobu Umeda and Armin Wolf, editors, Applications of Declarative Programming and Knowledge Management − 19th International Conference‚ INAP 2011‚ and 25th Workshop on Logic Programming‚ WLP 2011‚ Vienna‚ Austria‚ September 28−30‚ 2011‚ Revised Selected Papers. Vol. 7773 of Lecture Notes in Computer Science. Pages 259–268. Springer. 2013.
Details about dynPARTIX − A Dynamic Programming Reasoner for Abstract Argumentation | BibTeX data for dynPARTIX − A Dynamic Programming Reasoner for Abstract Argumentation | DOI (10.1007/978-3-642-41524-1) | Link to dynPARTIX − A Dynamic Programming Reasoner for Abstract Argumentation
-
[4]
The Impact of Disjunction on Query Answering Under Guarded−Based Existential Rules
Pierre Bourhis‚ Michael Morak and Andreas Pieris
In Francesca Rossi, editor, IJCAI 2013‚ Proceedings of the 23rd International Joint Conference on Artificial Intelligence‚ Beijing‚ China‚ August 3−9‚ 2013. IJCAI/AAAI. 2013.
Details about The Impact of Disjunction on Query Answering Under Guarded−Based Existential Rules | BibTeX data for The Impact of Disjunction on Query Answering Under Guarded−Based Existential Rules | Link to The Impact of Disjunction on Query Answering Under Guarded−Based Existential Rules
-
[5]
On the Complexity of Ontological Reasoning under Disjunctive Existential Rules
Georg Gottlob‚ Marco Manna‚ Michael Morak and Andreas Pieris
In Branislav Rovan‚ Vladimiro Sassone and Peter Widmayer, editors, Mathematical Foundations of Computer Science 2012 − 37th International Symposium‚ MFCS 2012‚ Bratislava‚ Slovakia‚ August 27−31‚ 2012. Proceedings. Vol. 7464 of Lecture Notes in Computer Science. Pages 1–18. Springer. 2012.
Details about On the Complexity of Ontological Reasoning under Disjunctive Existential Rules | BibTeX data for On the Complexity of Ontological Reasoning under Disjunctive Existential Rules | DOI (10.1007/978-3-642-32589-2) | Link to On the Complexity of Ontological Reasoning under Disjunctive Existential Rules
-
[6]
Evaluating Tree−Decomposition Based Algorithms for Answer Set Programming
Michael Morak‚ Nysret Musliu‚ Reinhard Pichler‚ Stefan Rümmele and Stefan Woltran
In Youssef Hamadi and Marc Schoenauer, editors, Learning and Intelligent Optimization − 6th International Conference‚ LION 6‚ Paris‚ France‚ January 16−20‚ 2012‚ Revised Selected Papers. Vol. 7219 of Lecture Notes in Computer Science. Pages 130–144. Springer. 2012.
Details about Evaluating Tree−Decomposition Based Algorithms for Answer Set Programming | BibTeX data for Evaluating Tree−Decomposition Based Algorithms for Answer Set Programming | DOI (10.1007/978-3-642-34413-8) | Link to Evaluating Tree−Decomposition Based Algorithms for Answer Set Programming
-
[7]
Preprocessing of Complex Non−Ground Rules in Answer Set Programming
Michael Morak and Stefan Woltran
In Agostino Dovier and Vítor Santos Costa, editors, Technical Communications of the 28th International Conference on Logic Programming‚ ICLP 2012‚ September 4−8‚ 2012‚ Budapest‚ Hungary. Vol. 17 of LIPIcs. Pages 247–258. Schloss Dagstuhl − Leibniz−Zentrum fuer Informatik. 2012.
Details about Preprocessing of Complex Non−Ground Rules in Answer Set Programming | BibTeX data for Preprocessing of Complex Non−Ground Rules in Answer Set Programming | DOI (10.4230/LIPIcs.ICLP.2012.247) | Link to Preprocessing of Complex Non−Ground Rules in Answer Set Programming
-
[8]
A New Tree−Decomposition Based Algorithm for Answer Set Programming
Michael Morak‚ Nysret Musliu‚ Reinhard Pichler‚ Stefan Rümmele and Stefan Woltran
In IEEE 23rd International Conference on Tools with Artificial Intelligence‚ ICTAI 2011‚ Boca Raton‚ FL‚ USA‚ November 7−9‚ 2011. Pages 916–918. IEEE Computer Society. 2011.
Details about A New Tree−Decomposition Based Algorithm for Answer Set Programming | BibTeX data for A New Tree−Decomposition Based Algorithm for Answer Set Programming | DOI (10.1109/ICTAI.2011.154) | Link to A New Tree−Decomposition Based Algorithm for Answer Set Programming
-
[9]
A Dynamic−Programming Based ASP−Solver
Michael Morak‚ Reinhard Pichler‚ Stefan Rümmele and Stefan Woltran
In Tomi Janhunen and Ilkka Niemelä, editors, Logics in Artificial Intelligence − 12th European Conference‚ JELIA 2010‚ Helsinki‚ Finland‚ September 13−15‚ 2010. Proceedings. Vol. 6341 of Lecture Notes in Computer Science. Pages 369–372. Springer. 2010.
Details about A Dynamic−Programming Based ASP−Solver | BibTeX data for A Dynamic−Programming Based ASP−Solver | DOI (10.1007/978-3-642-15675-5) | Link to A Dynamic−Programming Based ASP−Solver