Expansion Operators for Modelling Agent Reasoning in Possibilistic Logic Programming

Agentlink Clearinghouse is powered by GNU EPrints developed by the School of Electronics and Computer Science of the University of Southampton.
Type: Article

Chesñevar, C. I. and Simari, G. R. and Alsinet, T. and Godo, L. (2005) 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, incorporating 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 warranted literals. 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.

Deposited by Carlos Chesnevar on 19 December 2005

Archive Staff Only: edit this record


AgentLink is the European Commission's IST-funded Coordination Action for Agent-Based Computing
and is coordinated by the
University of Liverpool and University of Southampton
If you encounter any problems with these pages please contact web@agentlink.org.