12 citations · 19 across the 2 of their papers we have counts for
2 papers
cs.LO2017★ 7 cited
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…
cs.LO2012★ 12 cited
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…