Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
作者： Paul E. Dunne , Martin Caminada
DOI: 10.1007/978-3-540-87803-2_14
关键词: Theoretical computer science 、 Argumentation framework 、 Well-founded semantics 、 Formal semantics (linguistics) 、 Computational semantics 、 Operational semantics 、 Computer science 、 Denotational semantics 、 Descriptive complexity theory 、 Computational resource
摘要: Semi-stable semantics offer a further extension based formalism by which the concept of "collection justified arguments" in abstract argumentation frameworks may be described. In contrast to better known stable semantics, one advantage semi-stability is that any finite framework always has at least semi-stable extension. Although there been some development formal logical theory so several computational properties these extensions have identified, with exception algorithmic studies, more detailed investigation complexity issues neglected. Our purpose this article present number results on natural decision questions for semantics.
springer.com
sci-hub.st 参考文章(29)
Paul E. Dunne, The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks computational models of argument. pp. 147- 158 ,(2008)
Francesca Toni, Phan Minh Dung, Paolo Mancarella, A dialectic procedure for sceptical, assumption-based argumentation computational models of argument. pp. 145- 156 ,(2006)
Bernhard Nebel, Francesca Toni, Yannis Dimopoulos, Finding admissible and preferred arguments can be very hard principles of knowledge representation and reasoning. pp. 53- 61 ,(2000)
Bart Verheij, A labeling approach to the computation of credulous acceptance in argumentation international joint conference on artificial intelligence. pp. 623- 628 ,(2007)
Bart Verheij, Two Approaches to Dialectical Argumentation: Admissible Sets and Argumentation Stages ,(1999)
Pietro Baroni, Massimiliano Giacomin, Comparing Argumentation Semantics with Respect to Skepticism european conference on symbolic and quantitative approaches to reasoning and uncertainty. pp. 210- 221 ,(2007) , 10.1007/978-3-540-75256-1_21
Bernhard Nebel, Francesca Toni, Yannis Dimopoulos, Preferred Arguments are Harder to Compute than Stable Extension international joint conference on artificial intelligence. pp. 36- 43 ,(1999)
Martin WA Caminada, Walter A Carnielli, Paul E Dunne, Semi-Stable Semantics computational models of argument. pp. 121- 130 ,(2006)
Vladimir Lifschitz, Michael Gelfond, The stable model semantics for logic programming international conference on lightning protection. pp. 1070- 1080 ,(1988)
P.M. Dung, P. Mancarella, F. Toni, Computing ideal sceptical argumentation Artificial Intelligence. ,vol. 171, pp. 642- 674 ,(2007) , 10.1016/J.ARTINT.2007.05.003