Title of article
Approximating operators and semantics for abstract dialectical frameworks Original Research Article
Author/Authors
Hannes Strass، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
32
From page
39
To page
70
Abstract
We provide a systematic in-depth study of the semantics of abstract dialectical frameworks (ADFs), a recent generalisation of Dungʼs abstract argumentation frameworks. This is done by associating with an ADF its characteristic one-step consequence operator and defining various semantics for ADFs as different fixpoints of this operator. We first show that several existing semantical notions are faithfully captured by our definition, then proceed to define new ADF semantics and show that they are proper generalisations of existing argumentation semantics from the literature. Most remarkably, this operator-based approach allows us to compare ADFs to related nonmonotonic formalisms like Dung argumentation frameworks and propositional logic programs. We use polynomial, faithful and modular translations to relate the formalisms, and our results show that both abstract argumentation frameworks and abstract dialectical frameworks are at most as expressive as propositional normal logic programs.
Keywords
Abstract dialectical frameworks , Fixpoint semantics , Logic programming , approximations , Nonmonotonic reasoning , Abstract argumentation frameworks
Journal title
Artificial Intelligence
Serial Year
2013
Journal title
Artificial Intelligence
Record number
1208005
Link To Document