Michael Abseher

According to our database, Michael Abseher authored at least 8 papers between 2014 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

Computing secure sets in graphs using answer set programming.

Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Stefan Woltran

J. Log. Comput., 2020

2018

Dynamic Programming on Tree Decompositions with D-FLAT.

Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan, Stefan Woltran

Künstliche Intell., 2018

2017

Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning.

Michael Abseher, Nysret Musliu, Stefan Woltran

J. Artif. Intell. Res., 2017

htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond.

Michael Abseher, Nysret Musliu, Stefan Woltran

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016

Shift Design with Answer Set Programming.

Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub, Stefan Woltran

Fundam. Informaticae, 2016

Providing Built-In Counters in a Declarative Dynamic Programming Environment.

Michael Abseher, Marius Moldovan, Stefan Woltran

Proceedings of the KI 2016: Advances in Artificial Intelligence, 2016

2015

Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning.

Michael Abseher, Frederico Dusberger, Nysret Musliu, Stefan Woltran

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

The D-FLAT System for Dynamic Programming on Tree Decompositions.

Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran

Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014