69
Can a machine ever argue? Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

  • Upload
    others

  • View
    0

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Can a machine ever argue?

Francesca Toni

Department of Computing

Imperial College London

Computational Logic and Argumentation

Page 2: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Roadmap

past future present

(thanks)

Computational Argumentation

(Argumentation in AI)

Page 3: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Artificial Intelligence (AI)

Designing and building

machines

that behave intelligently=human-like

Page 4: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Arguing

Pervasive human ability

Page 5: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Reasoning as Arguing

“The function of reasoning is

argumentative. It is to devise and evaluate

arguments intended to persuade.”

Hugo Mercier, Dan Sperber: BEHAVIORAL AND BRAIN SCIENCES (2011)

Page 6: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Arguments vs Logic

Logic is the study of valid arguments

1st meaning: valid chains of reasoning

Every human is mortal, Socrates is human, therefore

Socrates is mortal

Every human is mortal, Socrates is human, therefore

Socrates is blond

No Martian is human, every human is mortal, therefore

some mortal is not Martian

Axioms of number theory hold, therefore 2 is

irrational

𝐴 implies 𝐵, 𝐴

𝐵 modus ponens

Page 7: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Law of Contradiction (LoC)

Opposite assertions are not true at the same time. (Aristotle 384-322 BC)

for example, a number cannot be both odd and even

• Anyone who denies LoC… must be plunged into fire, since fire and non-fire are identical …

(Avicenna (ibn Sīnā) 980–1037)

• Even “barbarians” must tacitly assume LoC…

(Leibniz 1646-1716)

• LoC is a consequence of the fundamental law of thought, whose expression is …x(1-x)=0

(Boole 1815-1864)

Page 8: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

LoC vs Tetralemma

“Everything is real and not real.

Both real and not real.

Neither real nor not real.”

(Nāgārjuna, 150-250)

Page 9: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Arguments vs Logic

Logic is the study of valid arguments

2nd meaning: valid disputes

There are two sides to every issue (Protagoras 490 – 420 BC & Sophists 5th century BC)

Page 10: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Conflicting (online) reviews

Page 11: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Conflicting opinions

Leaving the EU would lead to

lower trade between the UK and the EU

Leaving the EU would lead to a

lower net contribution to the EU budget

exit

stay

Page 12: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Conflicting evidence

Hormone Replacement Therapy (HRT)

for postmenopausal women:

does it help or harm your heart?

• Questionnaire-based studies suggested a benefit.

• Trials randomising some women to HRT and some

to placebo suggested no benefit and possible harm.

• Researchers found that benefit may vary: beneficial

before 60, harmful after 60. However the evidence

was not clear cut

Page 13: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Conflicting rules

Page 14: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Computational Argumentation

(Argumentation in AI)

Designing and building

machines

that argue

Get this book!

You will like it

because…

but I read

it already !

What about this?

It is about your

home town and

Page 15: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Arguing

from conflicting rules

Page 16: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Reasoning with Rules

YOU ARE COVERED FOR: UK and EU Breakdown Assistance for account holder(s) in any private car they are travelling in

YOU ARE NOT COVERED FOR: private cars not registered to the account holder(s) unless the account holder(s) are in the vehicle at the time of the breakdown

Zoe, Stef, Gio are all account holders

Zoe travels in her own car and the car breaks down

Stef travels with a friend in her car and the car breaks down

when he is out of the car

Gio travels in a friend’s car and the car breaks down when he is in it

covered

covered

not covered

Page 17: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Knowledge Representation and Reasoning (KR)

in AI

Problem Solution

Representation Automated

Reasoning output

?

17

Page 18: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

KR via Argumentation (own car ) covered as travelling in private car

cannot be attacked

(friend’s car, out of car) covered as travelling in private car

attacked by

not covered as car not registered to Stef

cannot be (counter-)attacked

(friend’s car, in car) covered as travelling in private car

attacked by

not covered as car not registered to Gio

(counter-)attacked by

Gio in car at time of breakdown

cannot be attacked

Page 19: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Abstract Argumentation (AA)

• A dispute can be abstracted away as a

(directed) graph:

– Nodes are arguments

– Edges are attacks

Dung 1995

Page 20: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Assumption-Based Argumentation

(ABA)

• Arguments have a “structure”: premises and conclusions (connected by rules); some of the premises can be assumed

covered because

account holder,

travelling in private car (since her own car),

assuming that

there are no objections against her being covered

• Arguments can only be attacked by attacking their assumptions (i.e. building arguments for contraries of assumptions)

Bondarenko, Dung, Kowalski, Toni 1997

Page 21: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

YOU ARE COVERED FOR: UK and EU Breakdown Assistance

for account holder(s) in any private car they are travelling in

YOU ARE NOT COVERED FOR: private cars not registered to

the account holder(s) unless the account holder(s) are in the

vehicle at the time of the breakdown

• Logic Programming

Which KR? ABA instances

contrary:

contrary:

Page 22: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

YOU ARE COVERED FOR: UK and EU Breakdown Assistance

for account holder(s) in any private car they are travelling in

YOU ARE NOT COVERED FOR: private cars not registered to

the account holder(s) unless the account holder(s) are in the

vehicle at the time of the breakdown

• Default logic (Reiter 1980)

Which KR? ABA instances

contrary:

contrary:

Page 23: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

YOU ARE COVERED FOR: UK and EU Breakdown Assistance for

account holder(s) in any private car they are travelling in

YOU ARE NOT COVERED FOR: private cars not registered to the

account holder(s) unless the account holder(s) are in the vehicle

at the time of the breakdown

• Non-monotonic modal logic (McDermott 1982)

• Autoepistemic Logic (Moore 1895) Circumscription

(McCarthy 1980), Theorist (Poole, 1988)

Which KR? ABA instances

contrary:

contrary:

Page 24: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Conflict Resolution in

AA and ABA

The outcome of a dispute can be

determined by (dialectical) semantics

evaluating arguments as justified if they

belong to “good” sets of arguments

not justified justified

Page 25: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Conflict-free sets of arguments

A set of arguments is conflict-free if it does

not attack itself

Page 26: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Admissible semantics

A set of arguments is admissible if it is conflict-

free and it attacks every argument that attacks it

Dung 1995; Bondarenko, Dung, Kowalski, Toni 1997

Page 27: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Ideal semantics

A set of arguments is ideal if it is maximal such that

(i) it is admissible and

(ii) it is contained in all maximally admissible sets

Dung, Mancarella, Toni 2007

Page 28: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Argumentation with preferences

(maximally) admissible

ideal Amgoud, Vesic 2014;

Cyras, Toni 2016

Page 29: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Stable semantics

A set of arguments is stable iff it is conflict-free

and it attacks every argument it does not contain

no stable set !

Dung 1995; Bondarenko, Dung, Kowalski, Toni 1997

Page 30: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Why no stable set of arguments?

c d

f

e a b

g

h

i

Schulz, Toni 2015-16

Page 31: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Conflict Resolution in

in AA and ABA

An argument is justified if it belong to a

“good” (e.g. admissible, ideal, stable) set

of arguments

not justified justified

Page 32: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Computational Complexity

Problem: is an argument justified

(given a semantics)?

admissible stable ideal

AA NP NP X

ABA- LP NP NP X

ABA-DL Y

ABA-AEL

Dimopoulos, Torres 1996; Dimopoulos, Nebel, Toni 2002; Dunne 2009

“easy”

“tough”

P

NP

X

Y

Page 33: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Dispute derivations

covered

proponent

opponent if Gio is account holder,

travelling in private car,

assuming covered ok

and indeed Gio is account holder

travelling in private car,

not covered

if car not registered to Gio,

assuming no exception applies

exception applies if

Gio was in the car when

it broke down

and indeed Gio was in the car

Kakas, Toni 1999

Dung, Kowalski, Toni 2006

Dung, Mancarella, Toni 2007

Toni 2012, Craven, Toni 2016

Page 34: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

ABA Dialogues Fan, Toni 2014

covered

if Zoe is account holder,

travelling in a private car,

assuming covered ok

indeed Zoe is account holder

and she was travelling in a private car

since it was her own car

can anybody argue that she is not covered?

not me

I cannot either

we are done then!

Page 35: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

ABA for decision making in

medicine

Mocanu, Fan, Toni, Williams, Chen 2014-16

Page 36: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

AA for Smart Electricity

Makriyiannis, Lung, Craven, Toni, Kelly 2014-16

Page 37: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

AA for Reinforcement Learning robocup

Gao, Toni 2012-15

Page 38: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Arguing

from opinions

Page 39: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

exit stay

support

Page 40: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Justified vs Weak/Strong Arguments

…. ….

….

weaker stronger

….

….

if opinions have

equal a-priori strength

exit stay

Page 41: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Computing strength

• All opinions have a base score (a-priori

strength) in [0,1]

• Opinions (arguments) attack or

support other opinions (arguments)

• Debates are (sets of) trees

Page 42: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Computing strength

To compute the strenght SF of argument x

the function C combines three elements:

the base score of x

a factor summarizing the attackers of x

a factor summarizing the supporters of x

using the sequence of the strengths of the attackers of x

Romano, Rago, Baroni, Toni , Aurisicchio, Bertanza 2013-16

Page 43: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Defining attacker/supporter

contribution

• For two attackers/supporters (*=a/s):

• For any number of attackers/supporters

(recursively, *=a/s):

Page 44: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Combining all factors:

properties

• The order of attackers/supporters does

not matter

• Adding a supporter will not lower strength

=

s s'

Page 45: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Combining all factors: more

properties

• The smaller the strength of an

attacker/supporter the smaller its impact

s s'

s0

if s0 is very small

then s' is almost the same as s

Page 46: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

IBIS (Issue Based Information System, Kunz and Rittel 1970)

www.arganddec.com

Aurisicchio, Baroni, Pellegrini, Toni (2015)

Page 47: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

www.arganddec.com

Page 48: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Baroni, Romano, Toni , Aurisicchio, Bertanza (2015 )

Page 49: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

REUSE OF SLUDGE PRODUCED BY WASTEWATER TREATMENT PLANTS

Page 50: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Integration of past cases into

debates

V. Evripidou, L. Carstens, F. Toni 2013-14

Page 51: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Acknowledgements and Thanks

Page 52: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Collaborators

Page 53: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

In particular…

Page 54: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

PhD students

Page 55: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation
Page 56: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Funding

Page 57: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Family and Friends

Page 58: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

AAMAS 2002

GC 2004

2003

Page 59: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation
Page 60: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Don’t you have

homework?

Yes, but I need to

relax first…

?%#@!!!

Page 61: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Can a machine ever argue?

better and more

Page 62: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Informative Machine-Human

Interaction

Cyras, Satoh, Toni 2016

40-50

small, 20

small, wireless, 45

Page 63: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Argumentation-based

Explanations

• Dispute trees as a basis for

explanations

• in natural language

• for Medicine, Law

Schulz, Toni 2015; Fan, Toni 2015

Mocanu, Fan, Toni, Williams, Chen 2014-16

Zhong, Fan, Toni, Luo 2014

O

P

P

O

P

Proponent Opponent

Page 64: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Probabilistic argumentation

Dung, Thang 2010; Dung, Thang, Toni 2016

rules (breakdown cover policy) data (account holders’ claims)

Probability of an account holder breaking down

when not travelling in own car?

Probabilistic arguments (how likely that an account holder will be covered?)

supported by assumptions and random variables

Page 65: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Argument mining

Carstens, Toni 2015

Page 66: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Deceptive behaviour

Cocarascu, Toni 2016

Lovely book, I liked the bit when they travel to Andros:

what a lovely island, and not too busy at all in August!

But nobody travels to Andros in the book!

LIE

OMISSION

Page 67: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Integrating qualitative + quantitative

reasoning

Carstens, Toni 2015

(A): standard classifier

(B): standard classifier+

argumentation

Cross-domain sentiment analysis

Gao, Toni (2012-15)

Reinforcement learning

Page 68: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

The future?

Are you joking?

Clean it yourself!

photo by Giulia

Page 69: Francesca Toni Department of Computing Imperial College Londonft/finalTalkInaugural.pdf · Francesca Toni Department of Computing Imperial College London Computational Logic and Argumentation

Thank you