2 citations · 4 across the 3 of their papers we have counts for
6 papers
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…
Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary report
Torsten Schaub, Kewen Wang
We analyze the problem of defining well-founded semantics for ordered logic programs within a general framework based on alternating fixpoint theory. We start by showing that gener…
A Consistency-Based Model for Belief Change: Preliminary Report
James Delgrande, Torsten Schaub
We present a general, consistency-based framework for belief change. Informally, in revising K by A, we begin with A and incorporate as much of K as consistently possible. Formally…
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…