53 citations · 201 across the 17 of their papers we have counts for
7 papers · 1 filter
Stepwise Debugging of Answer-Set Programs
Johannes Oetsch, Jörg Pührer, Hans Tompits
We introduce a stepping methodology for answer-set programming (ASP) that allows for debugging answer-set programs and is based on the stepwise application of rules. Similar to deb…
A general approach to belief change in answer set programming
James Delgrande, Torsten Schaub, Hans Tompits +1
We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Unlike previous approaches to belief change in logic programming, our formal…
Reasoning about Evolving Nonmonotonic Knowledge Bases
T. Eiter, M. Fink, G. Sabbatini +1
Recently, several approaches to updating knowledge bases modeled as extended logic programs have been introduced, ranging from basic methods to incorporate (sequences of) sets of r…
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report
David Pearce, Vladimir Sarsakov, Torsten Schaub +2
Nested logic programs have recently been introduced in order to allow for arbitrarily nested formulas in the heads and the bodies of logic program rules under the answer sets seman…
QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks
Uwe Egly, Thomas Eiter, Hans Tompits +1
In this paper, we outline the prototype of an automated inference tool, called QUIP, which provides a uniform implementation for several nonmonotonic reasoning formalisms. The theo…
Logic Programs with Compiled Preferences
James P. Delgrande, Torsten Schaub, Hans Tompits
We describe an approach for compiling preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in which rules are named…