2 citations · 2 across the 3 of their papers we have counts for
4 papers
Semantical Characterizations and Complexity of Equivalences in Answer Set Programming
Thomas Eiter, Michael Fink, Stefan Woltran
In recent research on non-monotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P union R and Q unio…
Paraconsistent Reasoning via Quantified Boolean Formulas,I: Axiomatising Signed Systems
Philippe Besnard, Torsten Schaub, Hans Tompits +1
Signed systems were introduced as a general, syntax-independent framework for paraconsistent reasoning, that is, non-trivialised reasoning from inconsistent information. In this pa…
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…