Result 1 to 19 of 19 total
Augmenting tractable fragments of abstract argumentation. (English)
Artif. Intell. 186, 157-173 (2012).
1
Towards fixed-parameter tractable algorithms for abstract argumentation. (English)
Artif. Intell. 186, 1-37 (2012).
2
Characterizing strong equivalence for argumentation frameworks. (English)
Artif. Intell. 175, No. 14-15, 1985-2009 (2011).
3
Dynamics of argumentation systems: a division-based method. (English)
Artif. Intell. 175, No. 11, 1790-1814 (2011).
4
Algorithms and complexity results for persuasive argumentation. (English)
Artif. Intell. 175, No. 9-10, 1722-1736 (2011).
5
Instantiating abstract argumentation with classical logic arguments: postulates and properties. (English)
Artif. Intell. 175, No. 9-10, 1479-1497 (2011).
6
Argumentation frameworks with necessities. (English)
Benferhat, Salem (ed.) et al., Scalable uncertainty management. 5th international conference, SUM 2011, Dayton, OH, USA, October 10‒13, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23962-5/pbk). Lecture Notes in Computer Science 6929. Lecture Notes in Artificial Intelligence, 163-176 (2011).
7
On the resolution-based family of abstract argumentation semantics and its grounded instance. (English)
Artif. Intell. 175, No. 3-4, 791-813 (2011).
8
Towards the proof-theoretic unification of Dung’s argumentation framework: an adaptive logic approach. (English)
J. Log. Comput. 21, No. 2, 133-156 (2011).
9
Complexity of semi-stable and stage semantics in argumentation frameworks. (English)
Inf. Process. Lett. 110, No. 11, 425-430 (2010).
10
A logical account of formal argumentation. (English)
Stud. Log. 93, No. 2-3, 109-145 (2009).
11
Meta-argumentation modelling. I: Methodology and techniques. (English)
Stud. Log. 93, No. 2-3, 297-355 (2009).
12
Complete extensions in argumentation coincide with 3-valued stable models in logic programming. (English)
Stud. Log. 93, No. 2-3, 383-403 (2009).
13
Towards a common framework for dialectical proof procedures in abstract argumentation. (English)
J. Log. Comput. 19, No. 6, 1071-1109 (2009).
14
The computational complexity of ideal semantics. (English)
Artif. Intell. 173, No. 18, 1559-1591 (2009).
15
Preferred extensions as stable models. (English)
Theory Pract. Log. Program. 8, No. 4, 527-543 (2008).
16
Computing ideal sceptical argumentation. (English)
Artif. Intell. 171, No. 10-15, 642-674 (2007).
17
Local logics, non-monotonicity and defeasible argumentation. (English)
J. Logic Lang. Inf. 14, No. 1, 1-12 (2005).
18
Defeasible dialectics: A controversy-oriented approach towards defeasible argumentation. (English)
J. Log. Comput. 3, No.3, 317-334 (1993).
19
Result 1 to 19 of 19 total
Start
Contact
Print
General Help
