Stefan Woltran | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/stefan-woltran/Stefan WoltranHugo Blox Builder (https://hugoblox.com)en-usMon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngStefan Woltranhttps://ac.tuwien.ac.at/team/stefan-woltran/Visualizing Extensions of Argumentation Frameworks as Layered Graphshttps://ac.tuwien.ac.at/publication/visualizing-extensions-of-argumentation-frameworks-as-layered-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualizing-extensions-of-argumentation-frameworks-as-layered-graphs/Tractable Abstract Argumentation via Backdoor-Treewidthhttps://ac.tuwien.ac.at/publication/tractable-abstract-argumentation-via-backdoor-treewidth/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/tractable-abstract-argumentation-via-backdoor-treewidth/Clique-Width and Directed Width Measures for Answer-Set Programminghttps://ac.tuwien.ac.at/publication/clique-width-and-directed-width-measures-for-answer-set-programming/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/clique-width-and-directed-width-measures-for-answer-set-programming/Computing secure sets in graphs using answer set programminghttps://ac.tuwien.ac.at/publication/computing-secure-sets-in-graphs-using-answer-set-programming/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-secure-sets-in-graphs-using-answer-set-programming/Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learninghttps://ac.tuwien.ac.at/publication/improving-the-efficiency-of-dynamic-programming-on-tree-decompositions-via-machine-learning/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/improving-the-efficiency-of-dynamic-programming-on-tree-decompositions-via-machine-learning/Tractable answer-set programming with weight constraints: bounded treewidth is not enoughhttps://ac.tuwien.ac.at/publication/tractable-answer-set-programming-with-weight-constraints-bounded-treewidth-is-not-enough-2/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/tractable-answer-set-programming-with-weight-constraints-bounded-treewidth-is-not-enough-2/Abstract Argumentation via Monadic Second Order Logichttps://ac.tuwien.ac.at/publication/abstract-argumentation-via-monadic-second-order-logic/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/abstract-argumentation-via-monadic-second-order-logic/Reasoning in Argumentation Frameworks of Bounded Clique-Widthhttps://ac.tuwien.ac.at/publication/reasoning-in-argumentation-frameworks-of-bounded-clique-width/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/reasoning-in-argumentation-frameworks-of-bounded-clique-width/Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enoughhttps://ac.tuwien.ac.at/publication/tractable-answer-set-programming-with-weight-constraints-bounded-treewidth-is-not-enough/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/tractable-answer-set-programming-with-weight-constraints-bounded-treewidth-is-not-enough/