Extensions

Question 1

When is a set A of Args conflict free?

Answer 1

iff A does not attack itself

Question 2

What is a admissible extension?

Answer 2

Conflict free and attacks each attacking argument

Question 3

What is a prefered extension?

Answer 3

Maximal admissible

Question 4

What is a complete extension?

Answer 4

A admissible extension containing all arguments it defends

Question 5

What is a stable extension?

Answer 5

c-f and attacks each argument not in it

Question 6

What is a grounded extension?

Answer 6

Minimal complete

Question 7

What is a sceptical prefered extension?

Answer 7

Interesection of all prefered extensions

Question 8

What is a ideal extension?

Answer 8

Maximal such that:

i) it is admissible
ii) It is contained in all prefered extensions

Question 9

What is a semi-stable extension?

Answer 9

If it is complete such that A U A+ is maximal where A+ is the set of arguments attacked by A

Question 10

When is a dispute tree:

1) Admissible
2) Grounded
3) Ideal

Answer 10

1) 
No nodes marked as both O and P and
Every O has exactly one child
2) 
Admissible and
Finite
3) 
Admissible and
for noe O node there exists a admissble dispute tree for the node.