Projektass. (FWF) Dipl.-Ing. Dr.techn.
Michael Abseher
Institute |
TU Wien
Institute of Information Systems
Database and Artificial Intelligence Group
|
Address |
Favoritenstraße 9-11
1040 Wien
Austria
|
Room |
HE 03 10 |
Mail |
|
Phone |
+43-1-58801-740045 |
Fax |
+43-1-58801-9740045 |
See also: TISS Address Book
Office Hours: By appointment (send me an e-mail)
Current Research
I'm currently involved in the following projects:
- D-FLAT
(Extending the Answer-Set Programming Paradigm to Decomposed Problem Solving)
- Decodyn
(Treating Hard Problems with Decomposition and Dynamic Programming)
In the context of my PhD thesis, I developed the htd framework for computing customized tree decompositions. This framework not only allows to obtain decompositions of low width efficiently, but also to obtain decompositions which adhere to custom quality criteria.
Teaching
Master's Theses
Co-Advisor for Master's thesis
Implementing Variations of the Traveling Salesperson Problem in a Declarative Dynamic Programming Environment (Thesis submitted 2015)
Author: Marius Moldovan
Supervision: Stefan Woltran
Publications
2017
- Abseher, M. Tailored Tree Decompositions for Efficient Problem Solving Ph.D. Thesis, TU Wien, 2017.
Supervision: Stefan Woltran and Nysret Musliu
Abstract BibTeX - Abseher, M.; Musliu, N. and Woltran, S. Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning In Journal of Artificial Intelligence Research, 58: 829-858, 2017.
[ Abstract BibTeX pdf ] - Abseher, M.; Musliu, N. and Woltran, S. htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond In Proceedings of the 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR 2017), pages 376-386, Springer, 2017.
Abstract BibTeX
2016
- Abseher, M.; Moldovan, M. and Woltran, S. Providing Built-In Counters in a Declarative Dynamic Programming Environment In Proceedings of the 39th German Conference on Artificial Intelligence (KI 2016), pages 3-16, 2016.
Abstract BibTeX - Abseher, M.; Gebser, M.; Musliu, N.; Schaub, T. and Woltran, S. Shift Design with Answer Set Programming In Fundamenta Informaticae, 147 (1): 1-25, 2016.
Abstract BibTeX
2015
- Abseher, M.; Bliem, B.; Charwat, G.; Dusberger, F. and Woltran, S. Computing Secure Sets in Graphs using Answer Set Programming In Journal of Logic and Computation, 2015.
[ Abstract BibTeX pdf ] - Abseher, M.; Gebser, M.; Musliu, N.; Schaub, T. and Woltran, S. Shift Design with Answer Set Programming In Proceedings of the 13th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2015), pages 32-39, 2015.
Abstract BibTeX - Abseher, M.; Dusberger, F.; Musliu, N. and Woltran, S. Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pages 275-282, 2015.
Abstract BibTeX
2014
- Abseher, M.; Bliem, B.; Charwat, G.; Dusberger, F.; Hecher, M. and Woltran, S. The D-FLAT System for Dynamic Programming on Tree Decompositions In Proceedings of the 14th European Conference on Logics in Artificial Intelligence (JELIA 2014), pages 558-572, 2014.
Abstract BibTeX - Abseher, M.; Bliem, B.; Charwat, G.; Dusberger, F.; Hecher, M. and Woltran, S. The D-FLAT System for Dynamic Programming on Tree Decompositions In Proceedings of the 4th International Workshop on Logic and Search (LaSh 2014), 2014.
Abstract BibTeX - Abseher, M.; Bliem, B.; Charwat, G.; Dusberger, F. and Woltran, S. Computing Secure Sets in Graphs using Answer Set Programming In Proceedings of the 7th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2014), 2014.
[ Abstract BibTeX pdf ]
2013
- Abseher, M. Solving Shift Design Problems with Answer Set Programming Master's Thesis, TU Wien, 2013.
Supervision: Stefan Woltran and Nysret Musliu
[ BibTeX pdf poster ]