Abstract

In this paper we address the modelling of reasoning processes in natural agents. We focus on a very basic kind of non-monotonic inference for which we identify a simple and plausible underlying process, and we develop a family of logical models that allow to match this process. Partial worlds models, as we call them, are a variant of Kraus, Lehmann and Magidor’s cumulative models. We show that the inference relations they induce form a strict subclass of cumulative relations and tackle the issue of providing sound and complete sets of rules to characterise them. Taking inspiration from the work of Gabbay and Schlechta, we analyse the question in terms of definable sets of partial worlds and conclude that completeness is probably unreachable using a standard propositional language. This brings us to enrich our language with an additional connective, which makes it possible to distinguish between two kinds of disjunction in the partial worlds context. Within this renewed framework, we provide two representation theorems: one for inference relations induced by precisification-free smooth models, and the other for inference relations induced by precisification-free ranked models. Finally we give an aperçu of how partial worlds models lend themselves to the modelling of learning.