55 citations · 277 across the 43 of their papers we have counts for
5 papers · 1 filter
Counting Answer Sets via Dynamic Programming
Johannes Fichte, Markus Hecher, Michael Morak +1
While the solution counting problem for propositional satisfiability (#SAT) has received renewed attention in recent years, this research trend has not affected other AI solving pa…
lpopt: A Rule Optimization Tool for Answer Set Programming
Manuel Bichler, Michael Morak, Stefan Woltran
State-of-the-art answer set programming (ASP) solvers rely on a program called a grounder to convert non-ground programs containing variables into variable-free, propositional prog…
Clique-Width and Directed Width Measures for Answer-Set Programming
Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran
Disjunctive Answer Set Programming (ASP) is a powerful declarative programming paradigm whose main decision problems are located on the second level of the polynomial hierarchy. Id…
Distributing Knowledge into Simple Bases
Adrian Haret, Jean-Guy Mailly, Stefan Woltran
Understanding the behavior of belief change operators for fragments of classical logic has received increasing interest over the last years. Results in this direction are mainly co…
Verifiability of Argumentation Semantics
Ringo Baumann, Thomas Linsbichler, Stefan Woltran
Dung's abstract argumentation theory is a widely used formalism to model conflicting information and to draw conclusions in such situations. Hereby, the knowledge is represented by…