[PPT] - A Petri net-based notation for normative modeling: evaluation on PowerPoint Presentation

SLIDE 1

A Petri net-based notation for normative modeling:

evaluation on deontic paradoxes

G i

v

a n n i S i l e n

2

, 1

g s i l e n

@e

n s t . f r A l e x a n d e r B

e

r

1

, T

m

v a n E n g e r s

1 1

L e i b n i z C e n t e r f

r

L a w , U n i v e r s i t y

f

A m s t e r d a m

2

T é l é c

m

P a r i s T e c h , U n i v e r s i t é P a r i s

S

a c l a y , P a r i s

1 6 J u n e 2 1 7 , M I R E L w

r

k s h

p

@ I C A I L

SLIDE 2

General Research Problem

A

l i g n i n g L a w a n d A c t i

n

SLIDE 3

General Research Problem

A

l i g n i n g L a w a n d A c t i

n

– l

a w c

n

c e r n s a s y s t e m

f

n

r

m s , t h a t i n a b s t r a c t , i n a fj x e d p

i

n t i n t i m e , m a y b e a p p r

a

c h e d a t e m p

r

a l l y .

SLIDE 4

General Research Problem

A

l i g n i n g L a w a n d A c t i

n

– l

a w c

n

c e r n s a s y s t e m

f

n

r

m s , t h a t i n a b s t r a c t , i n a fj x e d p

i

n t i n t i m e , m a y b e a p p r

a

c h e d a t e m p

r

a l l y .

– w

h e n a p p l i e d , l a w d e a l s w i t h a c

n

t i n u

u

s fm

w
f

e v e n t s .

SLIDE 5

General Research Problem

A

l i g n i n g L a w a n d A c t i

n

– l

a w c

n

c e r n s a s y s t e m

f

n

r

m s , t h a t i n a b s t r a c t , i n a fj x e d p

i

n t i n t i m e , m a y b e a p p r

a

c h e d a t e m p

r

a l l y .

– w

h e n a p p l i e d , l a w d e a l s w i t h a c

n

t i n u

u

s fm

w
f

e v e n t s .

P

r

t
t

y p i c a l e n c

u

n t e r : l e g a l c a s e s .

SLIDE 6

General Research Problem

A

l i g n i n g L a w a n d A c t i

n

– l

a w c

n

c e r n s a s y s t e m

f

n

r

m s , t h a t i n a b s t r a c t , i n a fj x e d p

i

n t i n t i m e , m a y b e a p p r

a

c h e d a t e m p

r

a l l y .

– w

h e n a p p l i e d , l a w d e a l s w i t h a c

n

t i n u

u

s fm

w
f

e v e n t s .

P

r

t
t

y p i c a l e n c

u

n t e r : l e g a l c a s e s .

M
r

e g e n e r a l b u t s i m i l a r p r

b

l e m : n a r r a t i v e i n t e r p r e t a t i

n

.

SLIDE 7

Looking for a notation

SLIDE 8

Steady states and transients

We n e e d a n

t

a t i

n

t

s

p e c i f y b

t

h !

P

h y s i c a l s y s t e m s c a n b e a p p r

a

c h e d f r

m

s t e a d y s t a t e ( e q u i l i b r i u m )

r

t r a n s i e n t ( n

n
e

q u i l i b r i u m , d y n a m i c ) p e r s p e c t i v e s

SLIDE 9

Steady states and transients

We n e e d a n

t

a t i

n

t

s

p e c i f y b

t

h !

P

h y s i c a l s y s t e m s c a n b e a p p r

a

c h e d f r

m

s t e a d y s t a t e ( e q u i l i b r i u m )

r

t r a n s i e n t ( n

n
e

q u i l i b r i u m , d y n a m i c ) p e r s p e c t i v e s

S

t e a d y s t a t e s d e s c r i p t i

n

s

m

i t t r a n s i e n t c h a r a c t e r i s t i c s

SLIDE 10

Steady states and transients

We n e e d a n

t

a t i

n

t

s

p e c i f y b

t

h !

P

h y s i c a l s y s t e m s c a n b e a p p r

a

c h e d f r

m

s t e a d y s t a t e ( e q u i l i b r i u m )

r

t r a n s i e n t ( n

n
e

q u i l i b r i u m , d y n a m i c ) p e r s p e c t i v e s

S

t e a d y s t a t e s d e s c r i p t i

n

s

m

i t t r a n s i e n t c h a r a c t e r i s t i c s e x . O h m ' s L a w V = R * I

SLIDE 11

Specifying transients and steady states

We n e e d a n

t

a t i

n

t

s

p e c i f y b

t

h !

P
s

s i b l e a n a l

g

i e s :

– s

t e a d y s t a t e a p p r

a

c h w i t h

L
g

i c

D

e c l a r a t i v e p r

g

r a m m i n g f

c

u s

n

Wh a t

SLIDE 12

Specifying transients and steady states

We n e e d a n

t

a t i

n

t

s

p e c i f y b

t

h !

P
s

s i b l e a n a l

g

i e s :

– s

t e a d y s t a t e a p p r

a

c h w i t h

L
g

i c

D

e c l a r a t i v e p r

g

r a m m i n g

– t

r a n s i e n t a p p r

a

c h

P

r

c

e s s m

d

e l i n g

P

r

c

e d u r a l p r

g

r a m m i n g f

c

u s

n

Wh a t

f

c

u s

n

H

w

SLIDE 13

Specifying transients and steady states

We n e e d a n

t

a t i

n

t

s

p e c i f y b

t

h !

P
s

s i b l e a n a l

g

i e s :

– s

t e a d y s t a t e a p p r

a

c h w i t h

L
g

i c

D

e c l a r a t i v e p r

g

r a m m i n g

– t

r a n s i e n t a p p r

a

c h

P

r

c

e s s m

d

e l i n g

P

r

c

e d u r a l p r

g

r a m m i n g f

c

u s

n

Wh a t

f

c

u s

n

H

w

P e t r i N e t s !

SLIDE 14

Specifying transients and steady states

We n e e d a n

t

a t i

n

t

s

p e c i f y b

t

h !

f

c

u s

n

Wh a t

f

c

u s

n

H

w

P e t r i N e t s !

P
s

s i b l e a n a l

g

i e s :

– s

t e a d y s t a t e a p p r

a

c h w i t h

L
g

i c

D

e c l a r a t i v e p r

g

r a m m i n g

– t

r a n s i e n t a p p r

a

c h

P

r

c

e s s m

d

e l i n g

P

r

c

e d u r a l p r

g

r a m m i n g

A n s w e r S e t P r

g

r a m m i n g

SLIDE 15

Specifying transients and steady states

We n e e d a n

t

a t i

n

t

s

p e c i f y b

t

h !

f

c

u s

n

Wh a t

f

c

u s

n

H

w

P e t r i N e t s !

P
s

s i b l e a n a l

g

i e s :

– s

t e a d y s t a t e a p p r

a

c h w i t h

L
g

i c

D

e c l a r a t i v e p r

g

r a m m i n g

– t

r a n s i e n t a p p r

a

c h

P

r

c

e s s m

d

e l i n g

P

r

c

e d u r a l p r

g

r a m m i n g

A n s w e r S e t P r

g

r a m m i n g

LPPN

logic programming petri nets

SLIDE 16

Logic Programming Petri Nets

SLIDE 17

procedural LPPN

p l a c e t r a n s i t i

n

p l a c e p l a c e

t

k

e n

SLIDE 18

t

k

e n

t
k

e n g a m e : t r a n s i t i

n

d i s a b l e d . I t c a n n

t

fj r e .

procedural LPPN

SLIDE 19

t
k

e n g a m e : t r a n s i t i

n

e n a b l e d . I t c a n fj r e .

procedural LPPN

SLIDE 20

t
k

e n g a m e : t r a n s i t i

n

fj r e s : i t w i l l c

n

s u m e t

k

e n s f r

m

t h e i n p u t p l a c e s .

procedural LPPN

SLIDE 21

t
k

e n g a m e : . . . a n d p r

d

u c e t

k

e n s i n t h e

u

t p u t s .

procedural LPPN

SLIDE 22

E

q u i v a l e n t t

A

S P / P r

l
g

: p6 :- p4, p5. p5. F O L : (p4 ∧ p5 p6) →

∧ p5

declarative LPPN for places

SLIDE 23

E

q u i v a l e n t t

A

S P / P r

l
g

: p6 :- p4, p5. p5. p4. F O L : (p4 ∧ p5 p6) →

∧ p5 ∧ p4

declarative LPPN for places

e n t a i l s

SLIDE 24

E

q u i v a l e n t t

A

S P / P r

l
g

: p6 :- p4, p5. p5. p4. F O L : (p4 ∧ p5 p6) →

∧ p5 ∧ p4

declarative LPPN for places

p6 e n t a i l s

SLIDE 25

declarative LPPN for transitions

E

q u i v a l e n t t

A

S P / P r

l
g

: t4 :- t2, p8. t3 :- t2, p9. F O L : (t2 ∧ p8 t4) →

∧ (t2 ∧ p9 t4)

→

SLIDE 26

declarative LPPN for transitions

E

q u i v a l e n t t

A

S P / P r

l
g

: t4 :- t2, p8. t3 :- t2, p9. t2. F O L : (t2 ∧ p8 t4) →

∧ (t2 ∧ p9 t4)

→

∧ t2

e n t a i l s

SLIDE 27

declarative LPPN for transitions

E

q u i v a l e n t t

A

S P / P r

l
g

: t4 :- t2, p8. t3 :- t2, p9. t2. F O L : (t2 ∧ p8 t4) →

∧ (t2 ∧ p9 t4)

→

∧ t2

e n t a i l s t4

SLIDE 28

declarative LPPN for transitions

E

q u i v a l e n t t

A

S P / P r

l
g

: t4 :- t2, p8. t3 :- t2, p9. t2. F O L : (t2 ∧ p8 t4) →

∧ (t2 ∧ p9 t4)

→

∧ t2

e n t a i l s t4 p r

d

u c e s p11

SLIDE 29

Evaluating the LPPN notation

SLIDE 30

Evaluating the LPPN notation

N
r

m a t i v e m

d

e l i n g i s

n

e

f

t h e p u r p

s

e s

f

t h e n

t

a t i

n

. We u s e d i t t

m
d

e l w e l l

k

n

w

n p r

b

l e m s d e fj n e d b y t h e d e

n

t i c l

g

i c c

m

m u n i t y .

SLIDE 31

Evaluating the LPPN notation

N
r

m a t i v e m

d

e l i n g i s

n

e

f

t h e p u r p

s

e s

f

t h e n

t

a t i

n

. We u s e d i t t

m
d

e l w e l l

k

n

w

n p r

b

l e m s d e fj n e d b y t h e d e

n

t i c l

g

i c c

m

m u n i t y .

C
n

t r a r y T

D

u t y ( C T D ) s t r u c t u r e s : s i t u a t i

n

s i n w h i c h a p r i m a r y

b

l i g a t i

n

e x i s t s , a n d w i t h i t s v i

l

a t i

n

, a s e c

n

d a r y

b

l i g a t i

n

c

m

e s i n t

e

x i s t e n c e .

SLIDE 32

Evaluating the LPPN notation

N
r

m a t i v e m

d

e l i n g i s

n

e

f

t h e p u r p

s

e s

f

t h e n

t

a t i

n

. We u s e d i t t

m
d

e l w e l l

k

n

w

n p r

b

l e m s d e fj n e d b y t h e d e

n

t i c l

g

i c c

m

m u n i t y .

C
n

t r a r y T

D

u t y ( C T D ) s t r u c t u r e s : s i t u a t i

n

s i n w h i c h a p r i m a r y

b

l i g a t i

n

e x i s t s , a n d w i t h i t s v i

l

a t i

n

, a s e c

n

d a r y

b

l i g a t i

n

c

m

e s i n t

e

x i s t e n c e .

C
m

m

n

i n e . g . c

m

p e n s a t

r

y n

r

m s .

SLIDE 33

Y
u

a r e f

r

b i d d e n t

c

r

s

s t h e r

a

d .

I

f y

u

a r e c r

s

s i n g t h e r

a

d , ( y

u

h a v e t

)

c r

s

s t h e r

a

d !

A simple deontic paradox

SLIDE 34

Y
u

a r e f

r

b i d d e n t

c

r

s

s t h e r

a

d .

I

f y

u

a r e c r

s

s i n g t h e r

a

d , ( y

u

h a v e t

)

c r

s

s t h e r

a

d !

Y
u

a r e c r

s

s i n g .

A simple deontic paradox

SLIDE 35

A simple deontic paradox

Y
u

a r e f

r

b i d d e n t

c

r

s

s t h e r

a

d .

I

f y

u

a r e c r

s

s i n g t h e r

a

d , ( y

u

h a v e t

)

c r

s

s t h e r

a

d !

Y
u

a r e c r

s

s i n g .

bl(not cross)

if cross then obl(cross) cross

bl(not cross)
bl(cross)

contradiction

SLIDE 36

U

s u a l s

l

u t i

n

: p r e f e r e n c e s a m

n

s t p

s

s i b l e w

r

l d s .

You mustn't cross the road. If you are crossing the road, cross the road!

SLIDE 37

U

s u a l s

l

u t i

n

: p r e f e r e n c e s a m

n

s t p

s

s i b l e w

r

l d s .

A

l t e r n a t i v e s

l

u t i

n

:

– i

m p l i c i t t e m p

r

a l m e a n i n g : i f y

u

s t a r t e d c r

s

s i n g t h e r

a

d , fj n i s h t

c

r

s

s t h e r

a

d ! → L e t u s i n c r e a s e g r a n u l a r i t y

f

t h e m

d

e l . . .

You mustn't cross the road. If you are crossing the road, cross the road!

SLIDE 38

V e r s i

n

1

You mustn't cross the road. If you are crossing the road, cross the road!

SLIDE 39

source firing V e r s i

n

1

Y
u

s t a r t c r

s

s i n g .

You mustn't cross the road. If you are crossing the road, cross the road!

SLIDE 40

propagation V e r s i

n

1

You mustn't cross the road. If you are crossing the road, cross the road!

Y
u

s t a r t c r

s

s i n g .

SLIDE 41

production consumption V e r s i

n

1

You mustn't cross the road. If you are crossing the road, cross the road!

Y
u

s t a r t c r

s

s i n g .

SLIDE 42

V e r s i

n

1

N
t

s

r

e a l i s t i c : i n t u i t i v e l y , w e s t i l l h a v e s u c h p r

h

i b i t i

n

.

You mustn't cross the road. If you are crossing the road, cross the road!

Y
u

a r e c r

s

s i n g .

SLIDE 43

V e r s i

n

1

N
t

s

r

e a l i s t i c : i n t u i t i v e l y , w e s t i l l h a v e s u c h p r

h

i b i t i

n

.

You mustn't cross the road. If you are crossing the road, cross the road!

Y
u

fj n i s h c r

s

s i n g .

SLIDE 44

V e r s i

n

1

N
t

s

r

e a l i s t i c : i n t u i t i v e l y , w e s t i l l h a v e s u c h p r

h

i b i t i

n

.

You mustn't cross the road. If you are crossing the road, cross the road!

Y
u

fj n i s h c r

s

s i n g .

SLIDE 45

V e r s i

n

2

You mustn't cross the road. If you are crossing the road, cross the road!

SLIDE 46

V e r s i

n

2 source firing

You mustn't cross the road. If you are crossing the road, cross the road!

Y
u

s t a r t c r

s

s i n g .

SLIDE 47

V e r s i

n

2 propagation

You mustn't cross the road. If you are crossing the road, cross the road!

Y
u

s t a r t c r

s

s i n g .

SLIDE 48

V e r s i

n

2 production

You mustn't cross the road. If you are crossing the road, cross the road!

Y
u

s t a r t c r

s

s i n g .

SLIDE 49

V e r s i

n

2 propagation

You mustn't cross the road. If you are crossing the road, cross the road!

Y
u

s t a r t c r

s

s i n g .

SLIDE 50

V e r s i

n

2 propagation

O b l i g a t i

n

h a s h i g h e r p r i

r

i t y ( t

p
l
g

y c a p t u r e s s a l i e n c e ) .

You mustn't cross the road. If you are crossing the road, cross the road!

Y
u

a r e c r

s

s i n g .

SLIDE 51

Gentle murderer

[ F

r

r e s t e r , 1 9 8 4 ]

It is forbidden to kill, but if one kills,

ne ought to kill gently.

SLIDE 52

Gentle murderer

[ F

r

r e s t e r , 1 9 8 4 ]

It is forbidden to kill, but if one kills,

ne ought to kill gently.

SLIDE 53

Gentle murderer

[ F

r

r e s t e r , 1 9 8 4 ]

It is forbidden to kill, but if one kills,

ne ought to kill gently.
H

e s t a r t s k i l l i n g .

SLIDE 54

Gentle murderer

[ F

r

r e s t e r , 1 9 8 4 ]

It is forbidden to kill, but if one kills,

ne ought to kill gently.
H

e s t a r t s k i l l i n g .

SLIDE 55

Gentle murderer

[ F

r

r e s t e r , 1 9 8 4 ]

It is forbidden to kill, but if one kills,

ne ought to kill gently.
H

e s t a r t s k i l l i n g .

SLIDE 56

Gentle murderer

[ F

r

r e s t e r , 1 9 8 4 ]

It is forbidden to kill, but if one kills,

ne ought to kill gently.
H

e s t a r t s k i l l i n g . ( e i t h e r h e k i l l s g e n t l y . . . )

SLIDE 57

Gentle murderer

[ F

r

r e s t e r , 1 9 8 4 ]

It is forbidden to kill, but if one kills,

ne ought to kill gently.
H

e s t a r t s k i l l i n g . ( e i t h e r h e k i l l s g e n t l y

r

n

t

. )

SLIDE 58

White fence

[ P r a k k e n & S e r g

t

, 1 9 9 6 ]

There must be no fence. If there is a fence, it must be a white fence. If the cottage is by the sea, there may be a fence.

SLIDE 59

White fence

[ P r a k k e n & S e r g

t

, 1 9 9 6 ]

There must be no fence. If there is a fence, it must be a white fence. If the cottage is by the sea, there may be a fence.

e x c e p t i

n

, i m p l i c i t d e f a u l t

SLIDE 60

White fence

[ P r a k k e n & S e r g

t

, 1 9 9 6 ]

There must be no fence. If there is a fence, it must be a white fence. If the cottage is by the sea, there may be a fence.

default generation

SLIDE 61

White fence

[ P r a k k e n & S e r g

t

, 1 9 9 6 ]

There must be no fence. If there is a fence, it must be a white fence. If the cottage is by the sea, there may be a fence.

SLIDE 62

White fence

[ P r a k k e n & S e r g

t

, 1 9 9 6 ]

There must be no fence. If there is a fence, it must be a white fence. If the cottage is by the sea, there may be a fence.

T

h e r e i s a w h i t e f e n c e .

SLIDE 63

White fence

[ P r a k k e n & S e r g

t

, 1 9 9 6 ]

There must be no fence. If there is a fence, it must be a white fence. If the cottage is by the sea, there may be a fence.

T

h e r e i s a w h i t e f e n c e .

SLIDE 64

White fence

[ P r a k k e n & S e r g

t

, 1 9 9 6 ]

There must be no fence. If there is a fence, it must be a white fence. If the cottage is by the sea, there may be a fence.

T

h e r e i s a w h i t e f e n c e .

SLIDE 65

White fence

[ P r a k k e n & S e r g

t

, 1 9 9 6 ]

There must be no fence. If there is a fence, it must be a white fence. If the cottage is by the sea, there may be a fence.

T

h e r e i s a w h i t e f e n c e .

SLIDE 66

Privacy Act

[ G

v

e r n a t

r

i , 2 1 5 ]

The collection of personal information is forbidden,

unless acting on a court order authorising it.

The destruction of illegally collected personal

information before accessing it is a defence against the illegal collection of the personal information.

The collection of medical information is forbidden,

unless the entity collecting the medical information is permitted to collect personal information.

SLIDE 67

Privacy Act

[ G

v

e r n a t

r

i , 2 1 5 ]

Forbidden A. If C, then Permitted A. If Forbidden A and A, then Obligatory B. Forbidden D. If Permitted A, then Permitted D.

The collection of personal information is forbidden,

unless acting on a court order authorising it.

The destruction of illegally collected personal

information before accessing it is a defence against the illegal collection of the personal information.

The collection of medical information is forbidden,

unless the entity collecting the medical information is permitted to collect personal information.

SLIDE 68

Privacy Act

[ G

v

e r n a t

r

i , 2 1 5 ]

Forbidden A. If C, then Permitted A. If Forbidden A and A, then Obligatory B. Forbidden D. If Permitted A, then Permitted D.

SLIDE 69

Privacy Act

[ G

v

e r n a t

r

i , 2 1 5 ]

Forbidden A. If C, then Permitted A. If Forbidden A and A, then Obligatory B. Forbidden D. If Permitted A, then Permitted D.

SLIDE 70

Privacy Act

[ G

v

e r n a t

r

i , 2 1 5 ]

Forbidden A. If C, then Permitted A. If Forbidden A and A, then Obligatory B. Forbidden D. If Permitted A, then Permitted D.

A
c

c u r s .

SLIDE 71

Privacy Act

[ G

v

e r n a t

r

i , 2 1 5 ]

Forbidden A. If C, then Permitted A. If Forbidden A and A, then Obligatory B. Forbidden D. If Permitted A, then Permitted D.

A
c

c u r s .

SLIDE 72

Privacy Act

[ G

v

e r n a t

r

i , 2 1 5 ]

Forbidden A. If C, then Permitted A. If Forbidden A and A, then Obligatory B. Forbidden D. If Permitted A, then Permitted D.

extra-institutional (“brute”) realm institutional realm constitutive rules

SLIDE 73

A bit further into deontic axioms

SLIDE 74

Factual detachment

p Obl (q|p) Obl (q) ∧ →

SLIDE 75

Deontic detachment

Obl (p) Obl (q|p) Obl (q) ∧ →

N

t

i m p l i e d b y L P P N ! I t d

e

s n

t

c a p t u r e t h e a n t i c i p a t i

n

.

SLIDE 76

Derived obligations

Bob’s promise to meet you commits him to meeting you.
It is obligatory that if Bob promises to meet you, he does so.

SLIDE 77

Derived obligations

Bob’s promise to meet you commits him to meeting you.

p Obl (m) →

It is obligatory that if Bob promises to meet you, he does so.

Obl (p m) →

SLIDE 78

Derived obligations

Bob’s promise to meet you commits him to meeting you.

p Obl (m) →

It is obligatory that if Bob promises to meet you, he does so.

Obl (p m) →

SLIDE 79

Derived obligations

p
Bob’s promise to meet you commits him to meeting you.

p Obl (m) →

It is obligatory that if Bob promises to meet you, he does so.

Obl (p m) →

SLIDE 80

Derived obligations

p

,

e

i t h e r m . .

Bob’s promise to meet you commits him to meeting you.

p Obl (m) →

It is obligatory that if Bob promises to meet you, he does so.

Obl (p m) →

SLIDE 81

Derived obligations

p

,

e

i t h e r m ,

r

¬ m

Bob’s promise to meet you commits him to meeting you.

p Obl (m) →

It is obligatory that if Bob promises to meet you, he does so.

Obl (p m) →

SLIDE 82

Derived obligations

p

,

e

i t h e r m ,

r

¬ m

b

u t w h a t a b

u

t ¬ p ?

Bob’s promise to meet you commits him to meeting you.

p Obl (m) →

It is obligatory that if Bob promises to meet you, he does so.

Obl (p m) →

SLIDE 83

Derived obligations

p

∧¬ m

Bob’s promise to meet you commits him to meeting you.

p Obl (m) →

It is obligatory that if Bob promises to meet you, he does so.

Obl (p m) →

SLIDE 84

Derived obligations

p

∧¬ m

m

. . .

Bob’s promise to meet you commits him to meeting you.

p Obl (m) →

It is obligatory that if Bob promises to meet you, he does so.

Obl (p m) →

SLIDE 85

Derived obligations

p

∧¬ m

m
r

¬ p

Bob’s promise to meet you commits him to meeting you.

p Obl (m) →

It is obligatory that if Bob promises to meet you, he does so.

Obl (p m) →

SLIDE 86

Chisholm’s paradox

[ C h i s h

l

m , 1 9 6 3 ]

SLIDE 87

Chisholm’s paradox

[ C h i s h

l

m , 1 9 6 3 ]

It ought to be that Jones goes (to the assistance of his neighbors).
It ought to be that if Jones goes, then he tells them he is coming.
If Jones doesn’t go, then he ought not tell them he is coming.
Jones doesn’t go.

SLIDE 88

Chisholm’s paradox

[ C h i s h

l

m , 1 9 6 3 ]

It ought to be that Jones goes (to the assistance of his neighbors).
It ought to be that if Jones goes, then he tells them he is coming.
If Jones doesn’t go, then he ought not tell them he is coming.
Jones doesn’t go.

Obl (go) Obl (go tell) → ¬go Forb(tell) → ¬go

SLIDE 89

Chisholm’s paradox

[ C h i s h

l

m , 1 9 6 3 ]

Obl (go) Obl (go tell) → ¬go Forb(tell) → ¬go

Y
u

d

n

' t g

.

SLIDE 90

Chisholm’s paradox

[ C h i s h

l

m , 1 9 6 3 ]

Obl (go) Obl (go tell) → ¬go Forb(tell) → ¬go

Y
u

d

n

' t g

.

SLIDE 91

Chisholm’s paradox

[ C h i s h

l

m , 1 9 6 3 ]

Obl (go) Obl (go tell) → ¬go Forb(tell) → ¬go

Y
u

d

n

' t g

.

. . Y

u

d

n

' t t e l l . . .

SLIDE 92

Chisholm’s paradox

[ C h i s h

l

m , 1 9 6 3 ]

Obl (go) Obl (go tell) → ¬go Forb(tell) → ¬go

Y
u

d

n

' t g

.

. . Y

u

t e l l t h e m . . .

SLIDE 93

Conclusions

SLIDE 94

Conclusions

We

p r e s e n t e d e x a m p l e s

f

a p p l i c a t i

n
f

a n

t

a t i

n

i n t r

d

u c e d f

r

w i d e r m

d

e l i n g p u r p

s

e s , b u t w h i c h c a n b e a p p l i e d f

r

n

r

m a t i v e s c e n a r i

s

:

SLIDE 95

Conclusions

We

p r e s e n t e d e x a m p l e s

f

a p p l i c a t i

n
f

a n

t

a t i

n

i n t r

d

u c e d f

r

w i d e r m

d

e l i n g p u r p

s

e s , b u t w h i c h c a n b e a p p l i e d f

r

n

r

m a t i v e s c e n a r i

s

:

– p

a r a d

x

i c a l c a s e s a r e e a s i l y u n v e i l e d

SLIDE 96

Conclusions

We

p r e s e n t e d e x a m p l e s

f

a p p l i c a t i

n
f

a n

t

a t i

n

i n t r

d

u c e d f

r

w i d e r m

d

e l i n g p u r p

s

e s , b u t w h i c h c a n b e a p p l i e d f

r

n

r

m a t i v e s c e n a r i

s

:

– p

a r a d

x

i c a l c a s e s a r e e a s i l y u n v e i l e d

– d

i r e c t l i n k w i t h b u s i n e s s p r

c

e s s p r a c t i c e s

SLIDE 97

Conclusions

We

p r e s e n t e d e x a m p l e s

f

a p p l i c a t i

n
f

a n

t

a t i

n

i n t r

d

u c e d f

r

w i d e r m

d

e l i n g p u r p

s

e s , b u t w h i c h c a n b e a p p l i e d f

r

n

r

m a t i v e s c e n a r i

s

:

– p

a r a d

x

i c a l c a s e s a r e e a s i l y u n v e i l e d

– d

i r e c t l i n k w i t h b u s i n e s s p r

c

e s s p r a c t i c e s

– v

i s u a l n

t

a t i

n

( a n i m a t i

n
f

m

d

e l s t h r

u

g h s i m u l a t i

n

m a k e t h e m i n p r i n c i p l e m

r

e a c c e s s i b l e )

SLIDE 98

Conclusions

We

p r e s e n t e d e x a m p l e s

f

a p p l i c a t i

n
f

a n

t

a t i

n

i n t r

d

u c e d f

r

w i d e r m

d

e l i n g p u r p

s

e s , b u t w h i c h c a n b e a p p l i e d f

r

n

r

m a t i v e s c e n a r i

s

.

D

e f a u l t s , e x c e p t i

n

s , s u s p e n s i

n

s r e q u i r e d e x t e n s i

n

s .

SLIDE 99

Conclusions

We

p r e s e n t e d e x a m p l e s

f

a p p l i c a t i

n
f

a n

t

a t i

n

i n t r

d

u c e d f

r

w i d e r m

d

e l i n g p u r p

s

e s , b u t w h i c h c a n b e a p p l i e d f

r

n

r

m a t i v e s c e n a r i

s

.

D

e f a u l t s , e x c e p t i

n

s , s u s p e n s i

n

s r e q u i r e d e x t e n s i

n

s .

~

m i n i m a l c

m

m i t m e n t ( c f . i n p u t /

u

t p u t l

g

i c ) O b l ( A ) O b l ( B ) ? ? O b l ( A B ) ∧ ∧

SLIDE 100

Conclusions

We

p r e s e n t e d e x a m p l e s

f

a p p l i c a t i

n
f

a n

t

a t i

n

i n t r

d

u c e d f

r

w i d e r m

d

e l i n g p u r p

s

e s , b u t w h i c h c a n b e a p p l i e d f

r

n

r

m a t i v e s c e n a r i

s

.

D

e f a u l t s , e x c e p t i

n

s , s u s p e n s i

n

s r e q u i r e d e x t e n s i

n

s .

I

n t e r e s t i n g s e m a n t i c c

r

r e s p

n

d e n c e w i t h l a n g u a g e

– n

u

n s , ( i m p e r f e c t ) v e r b s ~ p l a c e s / t

k

e n s

– (

p e r f e c t ) v e r b s ~ t r a n s i t i

n

/ t r a n s i t i

n

e v e n t s

SLIDE 101

Conclusions

We

p r e s e n t e d e x a m p l e s

f

a p p l i c a t i

n
f

a n

t

a t i

n

i n t r

d

u c e d f

r

w i d e r m

d

e l i n g p u r p

s

e s , b u t w h i c h c a n b e a p p l i e d f

r

n

r

m a t i v e s c e n a r i

s

.

D

e f a u l t s , e x c e p t i

n

s , s u s p e n s i

n

s r e q u i r e d e x t e n s i

n

s .

I

n t e r e s t i n g s e m a n t i c c

r

r e s p

n

d e n c e w i t h l a n g u a g e

– n

u

n s , ( i m p e r f e c t ) v e r b s ~ p l a c e s / t

k

e n s

– (

p e r f e c t ) v e r b s ~ t r a n s i t i

n

/ t r a n s i t i

n

e v e n t s

Wo

r k i n g h y p

t

h e s i s : d

e

s t h e l

c

u t

r

u s u a l l y p r

v

i d e t h e r i g h t g r a n u l a r i t y t

a

v

i

d t h e p a r a d

x