Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Record link: 
http://hdl.handle.net/20.500.12708/54177
-
Title: 
Computational Aspects of cf2 and stage2 Argumentation Semantics.
-
Citation: 
Dvorak, W., & Gaggl, S. (2012). Computational Aspects of cf2 and stage2 Argumentation Semantics. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Fourth International Conference on Computational Models of Argument (pp. 273–284). “Frontiers in Artificial Intelligence and Applications” series/IOS Press. http://hdl.handle.net/20.500.12708/54177
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Authors: 
Dvorak, Wolfgang 
Gaggl, Sarah 
-
Organisational Unit: 
E192-03 - Forschungsbereich Knowledge Based Systems 
E192-02 - Forschungsbereich Databases and Artificial Intelligence 
-
Published in: 
Proceedings of Fourth International Conference on Computational Models of Argument 
-
Date (published): 
2012
-
Event name: 
COMMA - International Conference on Computational Models of Argument 
-
Event date: 
11-Sep-2006 - 12-Sep-2006
-
Event place: 
Liverpool, UK, EU
-
Number of Pages: 
12
-
Publisher: 
"Frontiers in Artificial Intelligence and Applications" series/IOS Press, 245
-
Peer reviewed: 
Yes
-
Abstract: 
We consider two instantiations of the SCC-recursive schema for argumentation semantics, cf2, using maximal conflict-free sets as base semantics, and stage2, using stage extensions as base semantics. Both of them have been shown to be in general of high complexity. We provide a detailed analysis of possible tractable fragments
en
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
Mathematik, Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

180
checked on Nov 22, 2023

Google ScholarTM

Check