DocumentCode
2867331
Title
Studying Ideal Semantics via Logic Programming Semantics
Author
Nieves, Juan Carlos ; Osorio, Mauricio
Author_Institution
Dept. de Lleguatges i Sist. Inf., Univ. Politec. de Catalunya, Barcelona, Spain
fYear
2011
fDate
Nov. 26 2011-Dec. 4 2011
Firstpage
3
Lastpage
8
Abstract
In this paper, we show that by using extensions of the Well-Founded Semantics (WFS) which were defined in terms of rewriting systems, one can characterize ideal sets. We also show that these extensions of the well-founded semantics define argumentation semantics with similar behaviour to the ideal argumentation semantics. On the other hand, we introduce a new logic programming semantics which is able to characterize the ideal sets of an argumentation framework.
Keywords
logic programming; rewriting systems; WFS; argumentation semantics; ideal semantics; logic programming semantics; rewriting system; well-founded semantics; Artificial intelligence; Cognition; Electronic mail; Logic programming; Semantics; Transforms; Abstract Argumentation Semantics; Logic Programming Semantics; Non-monotonic Reasoning;
fLanguage
English
Publisher
ieee
Conference_Titel
Artificial Intelligence (MICAI), 2011 10th Mexican International Conference on
Conference_Location
Puebla
Print_ISBN
978-1-4577-2173-1
Type
conf
DOI
10.1109/MICAI.2011.31
Filename
6118990
Link To Document