Bernhard Bliem
| [surname] [at] dbai tuwien ac at |
Current Research
Since November 2017, I am a postdoctoral researcher at the Constraint Reasoning and Optimization group at University of Helsinki. Before that, I was a Ph.D. student under the supervision of Stefan Woltran, where I was engaged in the "Decodyn" project ("Treating Hard Problems with Decomposition and Dynamic Programming"). Previously I have been working on the "D-FLAT" project ("Extending the Answer Set Programming Paradigm to Decomposed Problem Solving"). I have developed the D-FLAT framework for using ASP on tree decompositions, which served as a starting point for the D-FLAT project.
Research Interests
Artificial intelligence:
- Answer set programming
- Propositional satisfiability
- Constraint satisfaction
- Knowledge representation & reasoning
- Computational social choice
- Logic programming
Algorithms and complexity:
- (Parameterized) complexity analysis
- Treewidth and other structural parameters
- Problems in the polynomial hierarchy