32 citations · 54 across the 5 of their papers we have counts for
5 papers
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
Nadia Creignou, Reinhard Pichler, Stefan Woltran
Many reasoning problems are based on the problem of satisfiability (SAT). While SAT itself becomes easy when restricting the structure of the formulas in a certain way, the situati…
Improved Answer-Set Programming Encodings for Abstract Argumentation
Sarah A. Gaggl, Norbert Manthey, Alessandro Ronca +2
The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literatu…
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough
Reinhard Pichler, Stefan Rümmele, Stefan Szeider +1
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relate…
Relativized hyperequivalence of logic programs for modular programming
Miroslaw Truszczyński, Stefan Woltran
A recent framework of relativized hyperequivalence of programs offers a unifying generalization of strong and uniform equivalence. It seems to be especially well suited for applica…
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming
Stefan Woltran
Logic programming under the answer-set semantics nowadays deals with numerous different notions of program equivalence. This is due to the fact that equivalence for substitution (k…