2 citations · 2 across the 3 of their papers we have counts for
6 papers
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…
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…
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…
A Compiler for Ordered Logic Programs
James P. Delgrande, Torsten Schaub, Hans Tompits
This paper describes a system, called PLP, for compiling ordered logic programs into standard logic programs under the answer set semantics. In an ordered logic program, rules are…