Studying Ideal Semantics via Logic Programming Semantics

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 a...

Full description

Saved in:
Bibliographic Details
Published in:2011 10th Mexican International Conference on Artificial Intelligence pp. 3 - 8
Main Authors: Nieves, J. C., Osorio, M.
Format: Conference Proceeding
Language:English
Published: IEEE 01.11.2011
Subjects:
Abstract Argumentation Semantics
Artificial intelligence
Cognition
Electronic mail
Logic programming
Logic Programming Semantics
Non-monotonic Reasoning
Semantics
Transforms
ISBN:9781457721731, 1457721732
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISBN:9781457721731
1457721732
DOI:10.1109/MICAI.2011.31