Bernhard Bliem

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Computing secure sets in graphs using answer set programming Journal Of Logic And Computation	2020-08-05	Paper
The impact of treewidth on grounding and solving of answer set programs Journal of Artificial Intelligence Research	2020-01-22	Paper
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs	2019-10-24	Paper
Defensive alliances in graphs of bounded treewidth Discrete Applied Mathematics	2018-12-03	Paper
Equivalence between answer-set programs under (partially) fixed input Annals of Mathematics and Artificial Intelligence	2018-09-21	Paper
Complexity of secure sets Algorithmica	2018-07-26	Paper
Clique-width and directed width measures for answer-set programming (available as arXiv preprint)	2018-07-12	Paper
ASP programs with groundings of small treewidth	2018-06-26	Paper
Implementing Courcelle's theorem in a declarative framework for dynamic programming Journal Of Logic And Computation	2018-02-13	Paper
D-FLAT\(^\wedge\)2: subset minimization in dynamic programming on tree decompositions made easy Fundamenta Informaticae	2017-11-09	Paper
Complexity of secure sets Graph-Theoretic Concepts in Computer Science	2016-10-21	Paper
Equivalence Between Answer-Set Programs Under (Partially) Fixed Input Lecture Notes in Computer Science	2016-05-19	Paper
The D-FLAT system for dynamic programming on tree decompositions Logics in Artificial Intelligence	2015-01-14	Paper
Declarative dynamic programming as an alternative realization of Courcelle's theorem Parameterized and Exact Computation	2013-12-10	Paper
D-FLAT: declarative problem solving using tree decompositions and answer-set programming Theory and Practice of Logic Programming	2013-03-13	Paper

Research outcomes over time

This page was built for person: Bernhard Bliem