We have studied the update operator ⊕1 defined for update sequences by Eiter et al. without tautologies and we have observed that it satisfies an interesting property. This property, which we call… (More)

We introduce the notion of X-stable models parametrized by a given logic X. Such notion is based on a construction that we call weak completions: a set of atoms M is an X-stable model of a theory T… (More)

Revising and updating knowledge bases is an important issue in knowledge representation and reasoning. Various proposals have been made recently for updating logic programs, in particular with… (More)

We study the notion of strong equivalence between two Answer Set programs and we show how some particular cases of testing strong equivalence between programs can be reduced to verify if a formula is… (More)

Given an argumentation framework AF, we introduce a mapping function that constructs a disjunctive logic program P, such that the preferred extensions of AF correspond to the stable models of P,… (More)

In the literature, there are several approaches which try to perform common sense reasoning. Among them, the approaches which have probably received the most attention the last two decades are the… (More)

Extension-based argumentation semantics is a successful approach for performing non-monotonic reasoning based on argumentation theory. An interesting property of some extension-based argumentation… (More)