Inferring preferred extensions by Pstable semantics

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/87510

dc.contributor	Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.contributor.author	Nieves Sánchez, Juan Carlos
dc.contributor.author	Osorio Galindo, Mauricio
dc.date	2007-07
dc.identifier.citation	Nieves, J. C., Osorio, M. "Inferring preferred extensions by Pstable semantics". 2007.
dc.identifier.uri	http://hdl.handle.net/2117/87510
dc.language.iso	eng
dc.relation	LSI-07-26-R
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
dc.subject	Argumentation theory
dc.subject	Logic programming
dc.subject	Non-monotonic reasoning
dc.title	Inferring preferred extensions by Pstable semantics
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/report
dc.description.abstract	Given an argumentation framework AF, we present a normal program Psi_{AF}, such that the preferred extensions of AF correspond exactly with the pstable models of Psi_{AF}. Moreover, we motivate the notion of suitable codifications for developing metainterpreters of argumentation theory based on logic programming.