46 research outputs found
To Preference via Entrenchment
We introduce a simple generalization of Gardenfors and Makinson's epistemic
entrenchment called partial entrenchment. We show that preferential inference
can be generated as the sceptical counterpart of an inference mechanism defined
directly on partial entrenchment.Comment: 16 page
Properties of ABA+ for Non-Monotonic Reasoning
We investigate properties of ABA+, a formalism that extends the well studied
structured argumentation formalism Assumption-Based Argumentation (ABA) with a
preference handling mechanism. In particular, we establish desirable properties
that ABA+ semantics exhibit. These pave way to the satisfaction by ABA+ of some
(arguably) desirable principles of preference handling in argumentation and
nonmonotonic reasoning, as well as non-monotonic inference properties of ABA+
under various semantics.Comment: This is a revised version of the paper presented at the worksho
El sistema de Poole: un estudio formal
Con el auge de la Inteligencia Artificial comenzaron a proliferar, a partir de la década de los 80, sistemas cuyo objetivo es reconstruir formalmente el razonamiento revocable. Los sistemas de Poole y Reiter se inscriben en esta vertiente.
El estudio metateórico de los sistemas para razonamiento revocable condujo a Gabbay, Makinson y otros a definir propiedades debilitadas como la monotonía cauta, la monotonía racional, etc.: propiedades positivas mínimas esperables en sistemas no-monótonos.
En el presente trabajo proponemos algunas definiciones alternativas y ofrecemos pruebas que evidencian ventajas comparativas del sistema de Poole
Preferential and Preferential-discriminative Consequence relations
The present paper investigates consequence relations that are both
non-monotonic and paraconsistent. More precisely, we put the focus on
preferential consequence relations, i.e. those relations that can be defined by
a binary preference relation on states labelled by valuations. We worked with a
general notion of valuation that covers e.g. the classical valuations as well
as certain kinds of many-valued valuations. In the many-valued cases,
preferential consequence relations are paraconsistant (in addition to be
non-monotonic), i.e. they are capable of drawing reasonable conclusions which
contain contradictions. The first purpose of this paper is to provide in our
general framework syntactic characterizations of several families of
preferential relations. The second and main purpose is to provide, again in our
general framework, characterizations of several families of preferential
discriminative consequence relations. They are defined exactly as the plain
version, but any conclusion such that its negation is also a conclusion is
rejected (these relations bring something new essentially in the many-valued
cases).Comment: team Logic and Complexity, written in 2004-200