Chesñevar, C. I. and Simari, G. R. and Alsinet, T. and Godo, L.
Expansion Operators for Modelling Agent Reasoning in Possibilistic Logic Programming.
Proc. of 3rd. EUMAS Workshop (Brussels, Belgium).
Full text not available from this archive.
Possibilistic Defeasible Logic Programming (Pdelp)
is a logic programming language which combines features
from argumentation theory and logic programming,
as well the treatment of possibilistic uncertainty and
fuzzy knowledge at object-language level.
Defeasible argumentation in general and Pdelp in particular
provide a way of modelling non-monotonic inference.
When modelling intelligent agents, capturing
defeasible inference relationships for modelling argument
and warrant is particularly important, as well as the
study of their logical properties.
This paper analyzes two specialized non-monotonic
operators for \Pdelp\ which model the expansion of a given program \progP\
by adding new weighed facts associated with argument conclusions and
Different logical properties %for the proposed expansion operators
are studied and analyzed, providing useful comparison criteria
that can be extended and
applied to other argumentation frameworks.
Archive Staff Only: edit this record