Commonsense Reasoning and Argumentation 14/15 HC 9 Structured argumentation (2) Henry Prakken March 4, 2015.

Slides:



Advertisements
Similar presentations
Visualization Tools, Argumentation Schemes and Expert Opinion Evidence in Law Douglas Walton University of Winnipeg, Canada Thomas F. Gordon Fraunhofer.
Advertisements

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.
Techniques for Proving the Completeness of a Proof System Hongseok Yang Seoul National University Cristiano Calcagno Imperial College.
Commonsense Reasoning and Argumentation 14/15 HC 8 Structured argumentation (1) Henry Prakken March 2, 2015.
Computational Models for Argumentation in MAS
On the structure of arguments, and what it means for dialogue Henry Prakken COMMA-08 Toulouse,
Hoare’s Correctness Triplets Dijkstra’s Predicate Transformers
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Commonsense Reasoning and Argumentation 14/15 HC 10: Structured argumentation (3) Henry Prakken 16 March 2015.
Default Reasoning the problem: in FOL, universally-quantified rules cannot have exceptions –  x bird(x)  can_fly(x) –bird(tweety) –bird(opus)  can_fly(opus)
Legal Argumentation 2 Henry Prakken March 28, 2013.
1 DCP 1172 Introduction to Artificial Intelligence Chang-Sheng Chen Topics Covered: Introduction to Nonmonotonic Logic.
Argumentation Logics Lecture 5: Argumentation with structured arguments (1) argument structure Henry Prakken Chongqing June 2, 2010.
Identifying and Analyzing Arguments in a Text Argumentation in (Con)Text Symposium, Jan. 4, 2007, Bergen.
Inferences The Reasoning Power of Expert Systems.
Argumentation Logics Lecture 1: Introduction Henry Prakken Chongqing May 26, 2010.
BIRDS FLY. is a bird Birds fly Tweety is a bird Tweety flies DEFEASIBLE NON-MONOTONIC PRESUMPTIVE?
Elements and Methods of Argumentation Theory University of Padua Lecture Padua, Italy, Dec.1, Douglas Walton Assumption University Chair in Argumentation.
Reasoning Rationally Using thinking to make good decisions.
Phil 160 Kant.
Argumentation Logics Lecture 7: Argumentation with structured arguments (3) Rationality postulates, Self-defeat Henry Prakken Chongqing June 4, 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.
The Problem of Induction Reading: ‘The Problem of Induction’ by W. Salmon.
Legal Argumentation 1 Henry Prakken March 21, 2013.
Commonsense Reasoning and Argumentation 14/15 HC 13: Dialogue Systems for Argumentation (1) Henry Prakken 25 March 2015.
Argumentation in Artificial Intelligence Henry Prakken Lissabon, Portugal December 11, 2009.
CS128 – Discrete Mathematics for Computer Science
FINDING THE LOGIC OF ARGUMENTATION Douglas Walton CRRAR Coimbra, March 24, 2011.
Reasoning with testimony Argumentation vs. Explanatory Coherence Floris Bex - University of Groningen Henry Prakken - University of Groningen - Utrecht.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin.
Argumentation Logics Lecture 6: Argumentation with structured arguments (2) Attack, defeat, preferences Henry Prakken Chongqing June 3, 2010.
Argumentation Henry Prakken SIKS Basic Course Learning and Reasoning May 26 th, 2009.
Critical thinking, session 1: about argument, MMUBS Mres Induction, slide-1 Critical thinking, session 1: About Argument Bruce Edmonds.
Argumentation Logics Lecture 7: Argumentation with structured arguments (3) Henry Prakken Chongqing June 4, 2010.
Argumentation Logics Lecture 6: Argumentation with structured arguments (2) Attack, defeat, preferences Henry Prakken Chongqing June 3, 2010.
Argumentation Logics Lecture 1: Introduction Henry Prakken Chongqing May 26, 2010.
BCOR 1020 Business Statistics
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.
Knowledge Representation and Reasoning University "Politehnica" of Bucharest Department of Computer Science Fall 2010 Adina Magda Florea
Inference is a process of building a proof of a sentence, or put it differently inference is an implementation of the entailment relation between sentences.
Introduction to formal models of argumentation
Indian Theories of Knowledge. What is Knowledge? Uncontroversially: Knowledge implies truth –I know that it’s Monday —> it’s Monday Almost as uncontroversially:
 Predicate: A sentence that contains a finite number of variables and becomes a statement when values are substituted for the variables. ◦ Domain: the.
Debate: Reasoning. Claims & Evidence Review Claims are statements that serve to support your conclusion. Evidence is information discovered through.
Legal Argumentation 3 Henry Prakken April 4, 2013.
Argument Visualization Tools for Corroborative Evidence 2 nd International Conference on Evidence Law and Forensic Science (ICELFS 2009) Beijing, China,
Review I Rosen , 3.1 Know your definitions!
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Chapter 5 Parameter estimation. What is sample inference? Distinguish between managerial & financial accounting. Understand how managers can use accounting.
Crime Scene Photography. Testimonial evidence is faulty. Admissions of guilt are not iron clad. Jurors are influenced by what they can see and experience.
Deductive vs. Inductive Arguments
Propositions and Arguments. What is a proposition? A proposition is a predicative sentence that only contains a subject and a predicate S is P.
A 10 Step Quest Every Time!. Overview When we hypothesis test, we are trying to investigate whether or not a sample provides strong evidence of something.
Forward and Backward Chaining
What is an argument? An argument is, to quote the Monty Python sketch, "a connected series of statements to establish a definite proposition." Huh? Three.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
1 Propositional Proofs 1. Problem 2 Deduction In deduction, the conclusion is true whenever the premises are true.  Premise: p Conclusion: (p ∨ q) 
Statistical Inference for the Mean Objectives: (Chapter 8&9, DeCoursey) -To understand the terms variance and standard error of a sample mean, Null Hypothesis,
Henry Prakken & Giovanni Sartor July 16, 2012
Inductive Argument Forms
Henry Prakken Guangzhou (China) 12 April 2018
Henry Prakken Guangzhou (China) 10 April 2018
Henry Prakken COMMA 2016 Berlin-Potsdam September 15th, 2016
Henry Prakken February 23, 2018
FCAT Science Standard Arianna Medina.
Presentation transcript:

Commonsense Reasoning and Argumentation 14/15 HC 9 Structured argumentation (2) Henry Prakken March 4, 2015

2 Overview Argument schemes Preferences Rationality postulates

3 Domain-specific vs. inference general inference rules d1: Bird  Flies s1: Penguin  Bird Penguin  K R d = { ,      } R s includes {S   | S |- PL  and S is finite} Bird  Flies  K Penguin  Bird  K Penguin  K Flies Bird Penguin Flies Bird Bird  Flies Penguin Penguin  Bird

4 Deriving the strict rules from a monotonic logic For any logic L with (monotonic) consequence notion |- L define S  p  R s iff S is finite and S |- L p

5 Argument(ation) schemes: general form But also critical questions Premise 1, …, Premise n Therefore (presumably), conclusion

6 Argument schemes in ASPIC Argument schemes are defeasible inference rules Critical questions are pointers to counterarguments Some point to undermining attacks Some point to rebutting attacks Some point to undercutting attacks

Perception Critical questions: Are the observer’s senses OK? Are the circumstances such that reliable observation of P is impossible? … P is observed Therefore (presumably), P

8 Reasoning with default generalisations But defaults can have exceptions And there can be conflicting defaults P If P then normally/usually/typically Q So (presumably), Q - What experts say is usually true - People with political ambitions are usually not objective about security - People with names typical from country C usually have nationality C - People who flea from a crime scene when the police arrives are normally involved in the crime - Chinese people usually don’t like coffee

9 How are generalisations justified? Scientific research (induction) Experts Commonsense Individual opinions Prejudice? Very reliable Very unreliable

10 Inducing generalisations Critical questions: Is the size of the sample large enough? was the sample selection biased? Almost all observed P’s were Q’s Therefore (presumably), If P then usually Q In 16 of 17 tests the ballpoint shot with this bow caused this type of eye injury A ballpoint shot with this type of bow will usually cause this type of eye injury

11 Expert testimony Critical questions: Is E biased? Is P consistent with what other experts say? Is P consistent with known evidence? E is expert on D E says that P P is within D Therefore (presumably), P is the case

Supporting and using generalisations V’s injury was caused by a fall This type of eye injury is usually caused by a fall V has this type of injury E says that his type of injury is usually caused by a fall E is an expert on this type of injury Expert testimony scheme Defeasible modus ponens

13 Witness testimony Critical questions: Is W sincere? Does W’s memory function properly? Did W’s senses function properly? W says P W was in the position to observe P Therefore (presumably), P P is usually of the form “I remember that I observed that...”

Memory Critical questions: Is the memory contaminated with other information? … P is recalled Therefore (presumably), P

15 Temporal persistence (Forward) Critical questions: Was P known to be false between T1 and T2? … P is true at T1 and T2 > T1 Therefore (presumably), P is still true at T2

16 Temporal persistence (Backward) Critical questions: Was P known to be false between T1 and T2? … P is true at T1 and T2 < T1 Therefore (presumably), P was already true at T2

17 X murdered Y Y murdered in house at 4:45 X in 4:45 X in 4:45 {X in 4:30} X in 4:45 {X in 5:00} X left 5:00 W3: “X left 5:00”W1: “X in 4:30” W2: “X in 4:30” X in 4:30 {W1} X in 4:30 {W2} X in 4:30 accrual testimony forw temp pers backw temp pers d.m.p. accrual V murdered in L at T & S was in L at T  S murdered V

18 Arguments from consequences Critical questions: Does A also have bad (good) consequences? Are there other ways to bring about G?... Action A causes G, G is good (bad) Therefore (presumably), A should (not) be done

19 Example (arguments pro and con an action) We should lower taxes Lower taxes increase productivity Increased productivity is good We should not lower taxes Lower taxes increase inequality Increased inequality is bad

20 Example (arguments pro alternative actions) We should lower taxes Lower taxes increase productivity Increased productivity is good We should invest in public infrastructure Investing in public infrastructure increases productivity Increased productivity is good

21 Refinement: promoting or demoting legal/societal values Critical questions: Are there other ways to cause G? Does A also cause something else that promotes or demotes other values?... Action A causes G, G promotes (demotes) legal/societal value V Therefore (presumably), A should (not) be done

22 Example (arguments pro and con an action) We should save DNA of all citizens Saving DNA of all citizens leads to solving more crimes Solving more crimes promotes security We should not save DNA of all citizens Saving DNA of all citizens makes more private data publicly accessible Making more private data publicly available demotes privacy

23 Example (arguments pro alternative actions) We should save DNA of all citizens Saving DNA of all citizens leads to solving more crimes Solving more crimes promotes security We should have more police Having more police leads to solving more crimes Solving more crimes promotes security

Argument schemes about action (generalised) Action A results in C1 … Action A results in Cn We should achieve C1 … We should achieve Cn Therefore, We should do A Action A results in C1 … Action A results in Cn We should avoid C1 … We should avoid Cn Therefore, We should not do A

25 Argument preference In general its origin is undefined General constraint: A < a B if B is strict-and- firm and A is defeasible or plausible. Could otherwise be defined in terms of partial preorders  (on R d ) and  ’ (on K p ) Origins of  and  ’: domain-specific!

26 Two example argument orderings (Informal: K p = , no strict-and-firm arguments) Weakest link ordering: Compares the weakest defeasible rule of each argument Last-link ordering: Compares the last defeasible rules of each argument

27 Example R d : r1: p  q r2: p  r r3: s  t R s : q, r  ¬t K: p,s

28 Comparing ordered sets (elitist ordering, weak version) Ordering  s on sets in terms of an ordering  (or  ’) on their elements: If S1 =  then not S1  s S2 If S1 ≠  and S2 =  then S1 < s S2 Else S1  s S2 if there exists an s1  S1 such that for all s2  S2: s1  s2

29 Comparing ordered sets (elitist ordering, strict version) Ordering < s on sets in terms of an ordering  (or  ’) on their elements: If S1 =  then not S1 < s S2 If S1 ≠  and S2 =  then S1 < s S2 Else S1 < s S2 if there exists an s1  S1 such that for all s2  S2: s1 < s2

Weakest-link ordering (formal) A < a B if B is strict-and-firm and A is defeasible or plausible. Otherwise: A  a B iff If both A and B are strict, then Prem p (A)  s Prem p (A2) If both A and B are firm, then DefRules(A)  s DefRules(B); else Prem p (A)  s Prem p (A2) and DefRules(A)  s DefRules(B) 30

Last-link ordering (formal) A < a B if B is strict-and-firm and A is defeasible or plausible. Otherwise: A  a B iff LDR(A)  s LDR(B); or A and B are strict and Prem p (A)  s Prem p (B) 31

32 Last link vs. weakest link (1) r1: Born in Scotland  Scottish r2: Scottish  Likes Whisky r3: Fitness Lover  ¬Likes Whisky K n : Born in Scotland, Fitness Lover r1 < r2, r1 < r3, r2 ≈ r3 Likes Whisky Scottish Born in Scotland  Likes Whisky Fitness lover r1 r2 r3

33 Weakest link r1: Born in Scotland  Scottish r2: Scottish  Likes Whisky r3: Fitness Lover  ¬Likes Whisky K n : Born in Scotland, Fitness Lover r1 < r2, r1 < r3, r2 ≈r3 Likes Whisky Scottish Born in Scotland  Likes Whisky Fitness lover r1 r2 r3

34 Last link r1: Born in Scotland  Scottish r2: Scottish  Likes Whisky r3: Fitness Lover  ¬Likes Whisky K n : Born in Scotland, Fitness Lover r1 < r2, r1 < r3, r2 ≈r3 Likes Whisky Scottish Born in Scotland  Likes Whisky Fitness lover r1 r2 r3

35 Last link vs. weakest link (2) r1: Snores  Misbehaves r2: Misbehaves  May be removed r3: Professor  ¬May be removed K n : Snores, Professor r1 < r2, r1 < r3, r2 ≈r3 May be removed Misbehaves Snores  May be removed Professor r1 r2 r3

36 Consistency in ASPIC+ (with symmetric negation) For any S  L S is directly consistent iff S does not contain two formulas  and –  The strict closure Cl(S) of S is S + everything derivable from S with only R s. S is indirectly consistent iff Cl(S) is directly consistent. Parametrised by choice of strict rules

Rationality postulates (Caminada & Amgoud 2007) Let E be any Dung-extension and Conc(E) = {  |  = Conc(A) for some A  E } An AT satisfies subargument closure iff B  E whenever A  E and B  Sub(A) direct consistency iff Conc(E) is directly consistent strict closure iff Cl(Conc(E)) = Conc(E) indirect consistency iff Conc(E) is indirectly consistent

38 Violation of direct and indirect consistency in ASPIC+ s1: r  ¬q K n =  ; K p = {q,r} r <’ q q qq r s1 > B1 A1 B2 B1 A1 B2

39 Violation of direct and indirect consistency in ASPIC+ s1: r  ¬q s2: q  ¬r K n =  ; K p = {q,r} r <’ q q qq r s1 rr Constraint on  a : If A = B   then A ≈ a B > B1 A1 B2 A2 s2

Trans- and contraposition Transposition: If S  p  R s then S/{s} U {–p}  –s  R s Contraposition: If S |- p and s  S then S/{s} U {– p} |- –s

41 Rationality postulates for ASPIC+ (whether consistent premises or not) Closure under subarguments always satisfied Strict closure, direct and indirect consistency: without preferences satisfied if R s closed under transposition or AS closed under contraposition; and K n is indirectly consistent with preferences satisfied if in addition  is ‘reasonable’ If A is plausible or defeasible and B is strict-and-firm then A < B If A = B   then A ≈ B (Complicated condition) Weakest- and last link ordering are reasonable