We present a framework for investigating merging operators for belief sets. This framework is a generalisation of our earlier work concerning consistency-based belief revision and...
In this paper, a possible worlds framework for representing general belief change operators is presented. In common with many approaches, an agent’s set of beliefs are specifie...
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
A simple model of rational belief holds that: (i) an instantaneous snapshot of an ideally rational belief system corresponds to a probability distribution; and (ii) rational belie...
Recommender systems have evolved in the last years as specialized tools to assist users in a plethora of computermediated tasks by providing guidelines or hints. Most recommender ...
This paper introduces a new class called hang yourself (HY) arguments into the theory of defeasible argumentation. The novelty of such arguments is that they are inherently destru...
We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
This paper presents a computational model for reasoning with causal explanations of observations within the framework of Abductive Event Calculus (AEC). The model is based on abdu...
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...