Michael Abseher

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Computing secure sets in graphs using answer set programming.
J. Log. Comput., 2020

2018
Dynamic Programming on Tree Decompositions with D-FLAT.
Künstliche Intell., 2018

2017
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning.
J. Artif. Intell. Res., 2017

htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016
Shift Design with Answer Set Programming.
Fundam. Informaticae, 2016

Providing Built-In Counters in a Declarative Dynamic Programming Environment.
Proceedings of the KI 2016: Advances in Artificial Intelligence, 2016

2015
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
The D-FLAT System for Dynamic Programming on Tree Decompositions.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014


  Loading...