Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Go back
Publication details
Main information
Argumentation-based Proof for an Argument in a Paraconsistent Setting
May 2007
aa07:argnmr
The paradigm of argumentation has been used in the literature to as- sign meaning to knowledge bases in general, and logic programs in particular. With this paradigm, rules of logic program are viewed as encoding arguments of an agent, and the meaning of the program is determined by those arguments that somehow (depending on the specific semantics) can defend themselves from the attacks of others arguments, named acceptable arguments. In previous work we presented an argumentation based declarative semantics allowing paraconsistent reasoning and also dealing with sets of logic programs that argue and cooperate among each other. In this paper we focus on the properties of this semantics in what regards paraconsistency and propose a procedure for proving an argument according to that semantics.
In proceedings
Iara Almeida, José Júlio Alferes
G. Simari, P. Torroni
Proceedings of Workshop on Argumentation and Non-Monotonic Reasoning (ArgNMR'07)
-
Online Proceedings
Tempe, Arizona, USA
-
64-79
-
-
-
-
Publication files
- click here to download - pdf 462 KB
Export formats
Iara Almeida and José Júlio Alferes, Argumentation-based Proof for an Argument in a Paraconsistent Setting, in: G. Simari and P. Torroni (eds), Proceedings of Workshop on Argumentation and Non-Monotonic Reasoning (ArgNMR'07), Online Proceedings, Tempe, Arizona, USA, Pag. 64-79, May 2007.
Iara Almeida and <a href="/people/members/view.php?code=6c74cfdbe88c7f9522c44ebcef69c8e7" class="author">José Júlio Alferes</a>, <b>Argumentation-based Proof for an Argument in a Paraconsistent Setting</b>, in: G. Simari and P. Torroni (eds), <u>Proceedings of Workshop on Argumentation and Non-Monotonic Reasoning (ArgNMR'07)</u>, Online Proceedings, Tempe, Arizona, USA, Pag. 64-79, May 2007.
@inproceedings {aa07:argnmr, author = {Iara Almeida and Jos{\'e} J{\'u}lio Alferes}, editor = {G. Simari and P. Torroni}, title = {Argumentation-based Proof for an Argument in a Paraconsistent Setting}, booktitle = {Proceedings of Workshop on Argumentation and Non-Monotonic Reasoning (ArgNMR'07)}, publisher = {Online Proceedings}, address = {Tempe, Arizona, USA}, pages = {64-79}, abstract = {The paradigm of argumentation has been used in the literature to as- sign meaning to knowledge bases in general, and logic programs in particular. With this paradigm, rules of logic program are viewed as encoding arguments of an agent, and the meaning of the program is determined by those arguments that somehow (depending on the specific semantics) can defend themselves from the attacks of others arguments, named acceptable arguments. In previous work we presented an argumentation based declarative semantics allowing paraconsistent reasoning and also dealing with sets of logic programs that argue and cooperate among each other. In this paper we focus on the properties of this semantics in what regards paraconsistency and propose a procedure for proving an argument according to that semantics.}, month = {May}, year = {2007}, }
Publication's urls
/publications/view.php?code=98d12807a1132aa4053d634354f61d64
/publications/view.php?code=aa07:argnmr
Go back
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

Fundacao_FCT