2 citations · 2 across the 3 of their papers we have counts for
Showing 2002Show all
2 papers · 1 filter
cs.LO2002★ 2 cited
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…
cs.AI2002
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…