Skip to Content

TU Wien Fakultät für Informatik DBAI Database and Artificial Intelligence Group
Top-level Navigation: Current-level Navigation:

Path: DBAI > staff > Bernhard Bliem

Tools: Print

Bernhard Bliem

Mail [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:

Algorithms and complexity:

Publications

2018

  1. Bernhard Bliem and Stefan Woltran Equivalence between answer-set programs under (partially) fixed input In Ann. Math. Artif. Intell., 83 (3-4): 277-295, 2018.
    [ Abstract | BibTeX | doi  ]
  2. Bernhard Bliem and Stefan Woltran Complexity of Secure Sets In Algorithmica, 80 (10): 2909-2940, 2018.
    [ Abstract | BibTeX | doi  ]

2017

  1. Bernhard Bliem Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017), Volume 58 of OASICS, pages 12:1-12:12, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
    [ Abstract | BibTeX | doi  ]
  2. Bernhard Bliem, Reinhard Pichler and Stefan Woltran Implementing Courcelle's Theorem in a declarative framework for dynamic programming In Journal of Logic and Computation, 27 (4): 1067-1094, 2017.
    [ Abstract | BibTeX | pdf  ]
  3. Bernhard Bliem, Marius Moldovan, Michael Morak and Stefan Woltran The Impact of Treewidth on ASP Grounding and Solving In Proc. of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pages 852-858, AAAI Press, 2017.
    [ Abstract | BibTeX | pdf  ]
  4. Bernhard Bliem and Stefan Woltran Defensive Alliances in Graphs of Bounded Treewidth In CoRR, abs/1707.04251, 2017.
    [ BibTeX | pdf  ]

2016

  1. Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub and Stefan Woltran ASP for Anytime Dynamic Programming on Tree Decompositions (Extended Abstract) In Proc. of the 39th German Conference on Artificial Intelligence (KI 2016), Volume 9904 of LNCS, pages 257-263, 2016.
    [ Abstract | BibTeX ]
  2. Bernhard Bliem, Sebastian Ordyniak and Stefan Woltran Clique-Width and Directed Width Measures for Answer-Set Programming In Workshop on Trends and Applications of Answer Set Programming (TAASP 2016), 2016.
    To appear.
    [ BibTeX ]
  3. Bernhard Bliem, Markus Hecher and Stefan Woltran On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions In Proc. of the 6th International Conference on Computational Models of Argument (COMMA 2016), Volume 287 of Frontiers in Artificial Intelligence and Applications, pages 107-118, IOS Press, 2016.
    [ Abstract | BibTeX | doi  ]
  4. Bernhard Bliem, Sebastian Ordyniak and Stefan Woltran Clique-Width and Directed Width Measures for Answer-Set Programming In Proc. of the 22nd European Conference on Artificial Intelligence (ECAI 2016), Volume 285 of FAIA, pages 1105-1113, IOS Press, 2016.
    [ Abstract | BibTeX | pdf  ]
  5. Bernhard Bliem, Günther Charwat, Markus Hecher and Stefan Woltran D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy In Fundamenta Informaticae, 147 (1): 27-61, 2016.
    [ Abstract | BibTeX | doi  ]
  6. Bernhard Bliem, Sebastian Ordyniak and Stefan Woltran Clique-Width and Directed Width Measures for Answer-Set Programming In CoRR, abs/1606.09449, 2016.
    [ BibTeX ]
  7. Bernhard Bliem, Robert Bredereck and Rolf Niedermeier Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels In Proc. of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pages 102-108, AAAI Press, 2016.
    [ Abstract | BibTeX | pdf  ]
  8. Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub and Stefan Woltran ASP for Anytime Dynamic Programming on Tree Decompositions In Proc. of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pages 979-986, AAAI Press, 2016.
    [ Abstract | BibTeX | pdf  ]
  9. Bernhard Bliem and Stefan Woltran Equivalence between Answer-Set Programs under (Partially) Fixed Input In Proc. of the Ninth International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2016), Volume 9616 of LNCS, pages 95-111, Springer, 2016.
    [ Abstract | BibTeX | pdf  ]
  10. Bernhard Bliem, Günther Charwat, Markus Hecher and Stefan Woltran Subset Minimization in Dynamic Programming on Tree Decompositions In AAAI-16 Workshop on Beyond NP, WS-16-05 , pages 300-306, 2016.
    [ Abstract | BibTeX | pdf  ]

2015

  1. Bernhard Bliem and Stefan Woltran Complexity of Secure Sets In 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Volume 9224 of LNCS, pages 64-77, Springer, 2015.
    [ Abstract | BibTeX | doi  ]
  2. Bernhard Bliem, Günther Charwat, Markus Hecher and Stefan Woltran D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy Technical Report DBAI-TR-2015-93, DBAI, Fakultät für Informatik an der Technischen Universität Wien, 2015.
    [ Abstract | BibTeX | pdf  ]
  3. Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger and Stefan Woltran Computing Secure Sets in Graphs using Answer Set Programming In Journal of Logic and Computation, 2015.
    (Special issue of ASPOCP 2014)
    [ Abstract | BibTeX | pdf  ]
  4. Bernhard Bliem, Günther Charwat, Markus Hecher and Stefan Woltran D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy In Eighth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2015), 2015.
    [ BibTeX ]

2014

  1. Bernhard Bliem and Stefan Woltran Complexity of Secure Sets In CoRR, abs/1411.6549, 2014.
    [ BibTeX | pdf  ]
  2. Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher and Stefan Woltran The D-FLAT System for Dynamic Programming on Tree Decompositions In Proc. of the 14th European Conference on Logics in Artificial Intelligence (JELIA 2014), Volume 8761 of LNCS, pages 558-572, Springer, 2014.
    [ Abstract | BibTeX | pdf  | system page  ]
  3. Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher and Stefan Woltran The D-FLAT System for Dynamic Programming on Tree Decompositions In Fourth International Workshop on Logic and Search (LaSh 2014), 2014.
    [ Abstract | BibTeX | pdf  | system page  ]
  4. Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger and Stefan Woltran Computing Secure Sets in Graphs using Answer Set Programming In Seventh Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2014), 2014.
    [ Abstract | BibTeX | pdf  ]
  5. Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher and Stefan Woltran D-FLAT: Progress Report Technical Report DBAI-TR-2014-86, DBAI, Vienna University of Technology, 2014.
    [ Abstract | BibTeX | pdf  ]

2013

  1. Bernhard Bliem, Reinhard Pichler and Stefan Woltran Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem In Proc. of the Eight International Symposium on Parameterized and Exact Computation (IPEC 2013), Volume 8246 of LNCS, pages 28-40, Springer, 2013.
    [ BibTeX | pdf  ]
  2. Bernhard Bliem, Reinhard Pichler and Stefan Woltran Applicability of ASP-based Problem Solving on Tree Decompositions In Third International Workshop on Graph Structures for Knowledge Representation and Reasoning (GKR 2013), 2013.
    [ BibTeX | pdf  ]

2012

  1. Bernhard Bliem Decompose, Guess & Check: Declarative Problem Solving on Tree Decompositions Master's Thesis, Vienna University of Technology, 2012.
    Stefan Woltran and Reinhard Pichler advisors. Received the ``Distinguished Young Alumnus'' award of the Faculty of Informatics at the Vienna University of Technology in June 2013.
    [ BibTeX | pdf  ]
  2. Bernhard Bliem, Michael Morak and Stefan Woltran D-FLAT: Declarative problem solving using tree decompositions and answer-set programming In Theory and Practice of Logic Programming, 12: 445-464, 2012.
    [ Abstract | BibTeX | pdf  ]

Home / Kontakt / Webmaster / Offenlegung gemäß § 25 Mediengesetz: Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. Disclaimer / Datenschutzerklärung