Michael Morak
| Address | Institute of Information Systems Database and Artificial Intelligence Group Vienna University of Technology Favoritenstraße 9-11 1040 Wien Austria |
|---|---|
| morak [at] dbai tuwien ac at | |
| Phone | +43-1-58801-740047 |
| Fax | +43-1-58801-9740047 |
You can find me in the TISS Adress Book
Research
My current research interests are in the area of logic programming, decomposition methods and parameterized complexity, as well as algorithm design using results from these fields.Curriculum Vitae
You can find a short curriculum vitae here.You may be interested in
- The dynASP project - a dynamic-programming based answer-set programming solver
- The SHARP Library - a framework for tree- and hypertree decomposition-based algorithms
Publications
Preprocessing of Complex Non-Ground Rules in Answer Set Programming
Michael Morak,
Stefan Woltran
Technical Report DBAI-TR-2011-72, Database and Artificial Intelligence Group,
Vienna University of Technology
(link)
Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming
Michael Morak,
Nysret Musliu,
Reinhard Pichler,
Stefan Rümmele,
Stefan Woltran
Technical Report DBAI-TR-2011-73, Database and Artificial Intelligence Group,
Vienna University of Technology
(link)
A New Tree-Decomposition Based Algorithm for Answer Set Programming
Michael Morak,
Nysret Musliu,
Reinhard Pichler,
Stefan Rümmele,
Stefan Woltran
ICTAI 2011, Proceedings, accepted for publication
dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation
Wolfgang Dvořák,
Michael Morak,
Clemens Nopp,
Stefan Woltran
INAP 2011, Proceedings, arXiv 1108.4804, accepted for publication
(paper at arXiv)
dynASP - A Dynamic-Programming Based Answer Set Programming Solver
Michael Morak,
Master's Thesis, Vienna University of Technology, published January 2011
(thesis at obv, direct link)
A Dynamic-Programming Based ASP-Solver
Michael Morak,
Reinhard Pichler,
Stefan Rümmele,
Stefan Woltran
Lecture Notes in Computer Science, Volume 6341, 2010, Pages 369-372, ISBN 978-3-642-15674-8, DOI: 10.1007/978-3-642-15675-5_34
(paper at SpringerLink)