Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Semi-stable semantics
Author: Caminada, MWA
Carnielli, WA
Dunne, PE
Abstract: In this article, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every stable extension is also a semi-stable extension. One of the advantages of semi-stable semantics is that for finite argumentation frameworks there always exists at least one semi-stable extension. Furthermore, if there also exists at least one stable extension, then the semi-stable extensions coincide with the stable extensions. Semi-stable semantics can be seen as a general approach that can be applied to abstract argumentation, as well as to fields like default logic and answer set programming, yielding an interpretation with properties very similar to those of paraconsistent logic, including the properties of crash resistance and backward compatibility.
Subject: Computational argumentation
default logic
logic programming
nonmonotonic reasoning
paraconsistent reasoning
Country: Inglaterra
Editor: Oxford Univ Press
Rights: fechado
Identifier DOI: 10.1093/logcom/exr033
Date Issue: 2012
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000309469900011.pdf737.96 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.