Sciweavers

RULEML
2010
Springer

On the Problem of Computing Ambiguity Propagation and Well-Founded Semantics in Defeasible Logic

13 years 10 months ago
On the Problem of Computing Ambiguity Propagation and Well-Founded Semantics in Defeasible Logic
Abstract. In this paper we present the well founded variants of ambiguity blocking and ambiguity propagating defeasible logics. We also show how to extend SPINdle, a state of the art, defeasible logic implementation to handle all such variants of defeasible logic.
Ho-Pun Lam, Guido Governatori
Added 30 Jan 2011
Updated 30 Jan 2011
Type Journal
Year 2010
Where RULEML
Authors Ho-Pun Lam, Guido Governatori
Comments (0)