Argumentation Logics Lecture 7: Argumentation with structured arguments (3) Rationality postulates, Self-defeat Henry Prakken Chongqing June 4, 2010.

Slides:



Advertisements
Similar presentations
Tutorial 2: First Order Logic and Methods of Proofs
Advertisements

With examples from Number Theory
Discrete Math Methods of proof 1.
Introduction to Proofs
On norms for the dynamics of argumentative interaction: argumentation as a game Henry Prakken Amsterdam January 18, 2010.
Chapter 3 Elementary Number Theory and Methods of Proof.
Argumentation Based on the material due to P. M. Dung, R.A. Kowalski et al.
Commonsense Reasoning and Argumentation 14/15 HC 8 Structured argumentation (1) Henry Prakken March 2, 2015.
Computational Models for Argumentation in MAS
Commonsense Reasoning and Argumentation 14/15 HC 9 Structured argumentation (2) Henry Prakken March 4, 2015.
Commonsense Reasoning and Argumentation 14/15 HC 10: Structured argumentation (3) Henry Prakken 16 March 2015.
Argumentation Logics Lecture 5: Argumentation with structured arguments (1) argument structure Henry Prakken Chongqing June 2, 2010.
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
Axiomatic systems and Incidence Geometry
Argumentation Logics Lecture 1: Introduction Henry Prakken Chongqing May 26, 2010.
Commonsense Reasoning and Argumentation 14/15 HC 12 Dynamics of Argumentation (1) Henry Prakken March 23, 2015.
Some problems with modelling preferences in abstract argumentation Henry Prakken Luxemburg 2 April 2012.
Argumentation in Artificial Intelligence Henry Prakken Lissabon, Portugal December 11, 2009.
CS128 – Discrete Mathematics for Computer Science
Argumentation Logics Lecture 4: Games for abstract argumentation Henry Prakken Chongqing June 1, 2010.
CSE115/ENGR160 Discrete Mathematics 01/31/12 Ming-Hsuan Yang UC Merced 1.
CSE115/ENGR160 Discrete Mathematics 02/01/11
Argumentation Logics Lecture 6: Argumentation with structured arguments (2) Attack, defeat, preferences Henry Prakken Chongqing June 3, 2010.
Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F
Argumentation Henry Prakken SIKS Basic Course Learning and Reasoning May 26 th, 2009.
So far we have learned about:
Proof Must Have Statement of what is to be proven.
Argumentation Logics Lecture 7: Argumentation with structured arguments (3) Henry Prakken Chongqing June 4, 2010.
Methods of Proof Leo Cheung. A Quick Review Direct proof Proof by contrapositive Proof by contradiction Proof by induction.
Argumentation Logics Lecture 6: Argumentation with structured arguments (2) Attack, defeat, preferences Henry Prakken Chongqing June 3, 2010.
Argumentation Logics Lecture 3: Abstract argumentation semantics (3) Henry Prakken Chongqing May 28, 2010.
Argumentation Logics Lecture 4: Games for abstract argumentation Henry Prakken Chongqing June 1, 2010.
Argumentation Logics Lecture 1: Introduction Henry Prakken Chongqing May 26, 2010.
Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari
Argumentation Logics Lecture 5: Argumentation with structured arguments (1) argument structure Henry Prakken Chongqing June 2, 2010.
Henry Prakken August 23, 2013 NorMas 2013 Argumentation about Norms.
Introduction to formal models of argumentation
Introduction to Proofs
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 03: PROOFS Section 1.5 Jarek Rossignac CS1050: Understanding.
F22H1 Logic and Proof Week 6 Reasoning. How can we show that this is a tautology (section 11.2): The hard way: “logical calculation” The “easy” way: “reasoning”
Homework Review notes Complete Worksheet #1. Homework Let A = {a,b,c,d}, B = {a,b,c,d,e}, C = {a,d}, D = {b, c} Describe any subset relationships. 1.
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
Commonsense Reasoning and Argumentation 14/15 HC 14: Dialogue systems for argumentation (2) Henry Prakken 30 March 2015.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Introduction to Proofs.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
Methods of Proof for Boolean Logic Chapter 5 Language, Proof and Logic.
2.3 Methods of Proof.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
Introduction to Proofs
1 CMSC 250 Chapter 3, Number Theory. 2 CMSC 250 Introductory number theory l A good proof should have: –a statement of what is to be proven –"Proof:"
Methods of Proof Lecture 4: Sep 20 (chapter 3 of the book, except 3.5 and 3.8)
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Goal:Use algebraic properties in logical arguments. 1.
Chapter 1 Logic and proofs
Argumentation Logics Lecture 2: Abstract argumentation grounded and stable semantics Henry Prakken Chongqing May 27, 2010.
Lecture 2: Proofs and Recursion. Lecture 2-1: Proof Techniques Proof methods : –Inductive reasoning Lecture 2-2 –Deductive reasoning Using counterexample.
CSE15 Discrete Mathematics 02/01/17
Discrete Mathematics Logic.
Indirect Argument: Contradiction and Contraposition
Proof Techniques.
Indirect Argument: Contradiction and Contraposition
Henry Prakken COMMA 2016 Berlin-Potsdam September 15th, 2016
Henry Prakken February 23, 2018
Applied Discrete Mathematics Week 2: Proofs
CS 220: Discrete Structures and their Applications
Review To check an argument with a tree:.
Discrete Mathematics Logic.
Indirect Argument: Contradiction and Contraposition
Henry Prakken Chongqing May 27, 2010
Presentation transcript:

Argumentation Logics Lecture 7: Argumentation with structured arguments (3) Rationality postulates, Self-defeat Henry Prakken Chongqing June 4, 2010

2 Overview Argumentation with structured arguments: Rationality postulates Self-defeat Odd and even defeat cycles

3 Rationality postulates (Caminada & Amgoud 2007) Let E be any stable, preferred or grounded extension: 1. If B  Sub(A) and A  E then B  E 2. The set {  |  = Conc(A) for some A  E } is closed under R S ; directly and indirectly consistent.

4 Rationality postulates for ASPIC system Closure under subarguments always satisfied Direct and indirect consistency: without ‘real’ preferences satisfied if R s closed under transposition, or AS closed under contraposition (and some further conditions) with ‘real’ preferences satisfied if in addition  a is weakest or last-link ordering

5 Subtleties concerning rebuttals (1) d1: Ring  Married d2: Party animal  Bachelor s1: Bachelor  ¬Married K : Ring, Party animal

6 Subtleties concerning rebuttals (2) d1: Ring  Married d2: Party animal  Bachelor s1: Bachelor  ¬Married s2: Married  ¬Bachelor K : Ring, Party animal

7 Subtleties concerning rebuttals (3) R d = { ,      } R s = all deductively valid inference rules K: d1: Ring  Married d2: Party animal  Bachelor n1: Bachelor  ¬Married Ring, Party animal

8 Parallel ‘self-defeat’ p pp qq q

9 Serial self-defeat p  A’ q,r  p A’A

10 r1: W says that p  p r2: W is unreliable  ¬r1 k1: Alice says that Alice is unreliable ¬r1 A is unreliable A: “A is unreliable”

11 ¬r1 A is unreliable A: “A is unreliable” J is the killer A: “J is the killer”

12 ¬r1 A is unreliable A: “A is unreliable” J is the killer A: “J is the killer”

13 ¬r1 A is unreliable A: “A is unreliable” J is the killer A: “J is the killer” J is the not killer B: “J is not the killer”

14 AB C DE A: Alice says that Bob is unreliable, so Bob is unreliable B: Bob says that Carole is unreliable, so Carole is unreliable C: Carole says that Alice is unreliable, so Alice is unreliable D: Bob says that John was the killer, so John was the killer E: Eric says that John was not the killer, so John was not the killer R: W says that p  p Exception: W is unreliable

15 A: Alice says that Bob is unreliable, so Bob is unreliable B: Bob says that Carole is unreliable, so Carole is unreliable C: Carole says that Fred is unreliable, so Fred is unreliable F: Fred says that Alice is unreliable, so Alice is unreliable D: Bob says that John was the killer, so John was the killer R: W says that p  p AB DE CF E: Eric says that John was not the killer, so John was not the killer Exception: W is unreliable

16 A: Alice says that Bob is unreliable, so Bob is unreliable B: Bob says that Carole is unreliable, so Carole is unreliable C: Carole says that Fred is unreliable, so Fred is unreliable F: Fred says that Alice is unreliable, so Alice is unreliable D: Bob says that John was the killer, so John was the killer R: W says that p  p AB DE CF E: Eric says that John was not the killer, so John was not the killer Exception: W is unreliable

17 AB C DE AB DE CF 1. An argument is In if all arguments defeating it are Out. 2. An argument is Out if it is defeated by an argument that is In.

18 AB C DE AB DE CF 1. An argument is In if all arguments defeating it are Out. 2. An argument is Out if it is defeated by an argument that is In.

19 AB C DE AB DE CF 1. An argument is In if all arguments defeating it are Out. 2. An argument is Out if it is defeated by an argument that is In. E is not justifiedE is justified 3. An argument is justified if it is In in all labellings

20 AB DE CF S defends A if all defeaters of A are defeated by a member of S S is admissible if it is conflict-free and defends all its members {A,C,E} is admissible …

21 AB DE CF S defends A if all defeaters of A are defeated by a member of S S is admissible if it is conflict-free and defends all its members {A,C,E} is admissible … {B,D,F} is admissible …

22 AB C DE S defends A if all defeaters of A are defeated by a member of S S is admissible if it is conflict-free and defends all its members {E} is admissible …

23 AB C DE S defends A if all defeaters of A are defeated by a member of S S is admissible if it is conflict-free and defends all its members {E} is admissible … but {B,D} is not …

24 AB C DE S defends A if all defeaters of A are defeated by a member of S S is admissible if it is conflict-free and defends all its members {E} is admissible … but {B,D} is not … and {A,B,D} is not

25 A problem(?) with grounded semantics We have: We want(?): AB C D AB C D

26 A problem(?) with grounded semantics AB C D A = Frederic Michaud is French since he has a French name B = Frederic Michaud is Dutch since he is a marathon skater C = F.M. likes the EU since he is European (assuming he is not Dutch or French) D = F.M. does not like the EU since he looks like a person who does not like the EU

27 A problem(?) with grounded semantics AB C D A = Frederic Michaud is French since Alice says so B = Frederic Michaud is Dutch since Bob says so C = F.M. likes the EU since he is European (assuming he is not Dutch or French) D = F.M. does not like the EU since he looks like a person who does not like the EU E E = Alice and Bob are unreliable since they contradict each other