The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
To improve the ability of predicting the impact scope of a given change, we present two approaches applicable to the maintenance of object-oriented software systems. Our first ap...
In this paper we investigate how to represent and reason about legal abrogations and annulments in Defeasible Logic. We examine some options that embed in this setting, and in simi...
The postulate of Recovery, among the six postulates for theory contraction, formulated and studied by Alchourr´on, G¨ardenfors and Makinson is the one that has provoked most cont...