Bernhard Bliem

27 papers A* 3A 1B 4C 1Journal 13Unranked 4
YearRankTypeTitle / Venue / Authors
2020 J jnl
Computing secure sets in graphs using answer set programming.
J. Log. Comput.
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Stefan Woltran
2020 J jnl
The Impact of Treewidth on Grounding and Solving of Answer Set Programs.
J. Artif. Intell. Res.
Bernhard Bliem, Michael Morak, Marius Moldovan, Stefan Woltran
2019 B conf
Centrality Heuristics for Exact Model Counting.
ICTAI
Bernhard Bliem, Matti Järvisalo
2018 — conf
ASP Programs with Groundings of Small Treewidth.
FoIKS
Bernhard Bliem
2018 J jnl
Complexity of Secure Sets.
Algorithmica
Bernhard Bliem, Stefan Woltran
2018 J jnl
Defensive alliances in graphs of bounded treewidth.
Discret. Appl. Math.
Bernhard Bliem, Stefan Woltran
2018 J jnl
Dynamic Programming on Tree Decompositions with D-FLAT.
Künstliche Intell.
Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan, Stefan Woltran
2018 J jnl
Equivalence between answer-set programs under (partially) fixed input.
Ann. Math. Artif. Intell.
Bernhard Bliem, Stefan Woltran
2017 J jnl
Defensive Alliances in Graphs of Bounded Treewidth.
CoRR
Bernhard Bliem, Stefan Woltran
2017 J jnl
Implementing Courcelle's Theorem in a declarative framework for dynamic programming.
J. Log. Comput.
Bernhard Bliem, Reinhard Pichler, Stefan Woltran
2017 A* conf
The Impact of Treewidth on ASP Grounding and Solving.
IJCAI
Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran
2017 — ch.
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs.
Ausgezeichnete Informatikdissertationen
Bernhard Bliem
2017 — conf
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs.
ICLP (Technical Communications)
Bernhard Bliem
2016 A* conf
ASP for Anytime Dynamic Programming on Tree Decompositions.
IJCAI
Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub, Stefan Woltran
2016 A conf
Clique-Width and Directed Width Measures for Answer-Set Programming.
ECAI
Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran
2016 J jnl
Clique-Width and Directed Width Measures for Answer-Set Programming.
CoRR
Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran
2016 A* conf
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels.
IJCAI
Bernhard Bliem, Robert Bredereck, Rolf Niedermeier
2016 J jnl
D-FLAT
Fundam. Informaticae
Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran
2016 — conf
Equivalence Between Answer-Set Programs Under (Partially) Fixed Input.
FoIKS
Bernhard Bliem, Stefan Woltran
2016 C conf
On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions.
COMMA
Bernhard Bliem, Markus Hecher, Stefan Woltran
2016 — conf
Subset Minimization in Dynamic Programming on Tree Decompositions.
AAAI Workshop: Beyond NP
Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran
2015 B conf
Complexity of Secure Sets.
WG
Bernhard Bliem, Stefan Woltran
2014 J jnl
Complexity of Secure Sets.
CoRR
Bernhard Bliem, Stefan Woltran
2014 B conf
The D-FLAT System for Dynamic Programming on Tree Decompositions.
JELIA
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran
2013 B conf
Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem.
IPEC
Bernhard Bliem, Reinhard Pichler, Stefan Woltran
2012 J jnl
D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming
CoRR
Bernhard Bliem, Michael Morak, Stefan Woltran
2012 J jnl
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming.
Theory Pract. Log. Program.
Bernhard Bliem, Michael Morak, Stefan Woltran