We express Brewka’s prioritised default logic (PDL) as argumentation using ASPIC. By representing PDL as argumentation and designing an argument preference relation that takes the argument structure into account, we prove that the conclusions of the justified arguments correspond to the PDL extensions. We will first assume that the default priority is total, and then generalise to the case wher...

Thanks to two stronger versions of predicate circumscription (one of the best known non-monotonic reasoning methods), we give a definitive answer to two old open problems. The first one is the problem of expressing domain circumscription in terms of predicate circumscription. The second one is the problem of definability of the circumscribed predicates, asked by Doyle in 1985, and never answere...

We present GLukG, a paraconsistent logic recently introduced. We discuss our motivation as well as interesting properties of this logic. We introduce a non-monotonic semantics based on GLukG.

Considerable attention has been given to the problem of non-monotonic reasoning in a belief function framework. Earlier work (M. Ginsberg) proposed solutions introducing meta-rules which recognized conditional independencies in a probabilistic sense. More recently an e-calculus formulation of default reasoning (J. Pearl) shows that the application of Dempster's rule to a non-monotonic situation...

This paper continues the research fromour previous work [1]. In [1], we formulated a practical analytical approach to evaluating continuous, monotonic functions of independent fuzzy numbers, which is based on an alternative formulation of the extension principle [2]. In this paper, we extend this approach to general, nonmonotonic functions of independent fuzzy numbers. For the theoretical backg...