A Semantics for Means-End Relations Jesse Hughes Technical - - PowerPoint PPT Presentation

a semantics for means end relations
SMART_READER_LITE
LIVE PREVIEW

A Semantics for Means-End Relations Jesse Hughes Technical - - PowerPoint PPT Presentation

Means-end relations in PDL Additional topics A Semantics for Means-End Relations Jesse Hughes Technical University of Eindhoven August 29, 2005 Hughes A Semantics for Means-End Relations Means-end relations in PDL Additional topics


slide-1
SLIDE 1

Means-end relations in PDL Additional topics

A Semantics for Means-End Relations

Jesse Hughes

Technical University of Eindhoven

August 29, 2005

Hughes A Semantics for Means-End Relations

slide-2
SLIDE 2

Means-end relations in PDL Additional topics

Practical Reasoning

Practical reasoning is concerned with actions to attain desired results.

Hughes A Semantics for Means-End Relations

slide-3
SLIDE 3

Means-end relations in PDL Additional topics

Practical Reasoning

Practical reasoning is concerned with actions to attain desired results. Typical practical syllogisms include premises:

Hughes A Semantics for Means-End Relations

slide-4
SLIDE 4

Means-end relations in PDL Additional topics

Practical Reasoning

Practical reasoning is concerned with actions to attain desired results. Typical practical syllogisms include premises: an assertion that some end ϕ is desirable,

Hughes A Semantics for Means-End Relations

slide-5
SLIDE 5

Means-end relations in PDL Additional topics

Practical Reasoning

Practical reasoning is concerned with actions to attain desired results. Typical practical syllogisms include premises: an assertion that some end ϕ is desirable, an assertion that (given ψ), the action α is related to ϕ,

Hughes A Semantics for Means-End Relations

slide-6
SLIDE 6

Means-end relations in PDL Additional topics

Practical Reasoning

Practical reasoning is concerned with actions to attain desired results. Typical practical syllogisms include premises: an assertion that some end ϕ is desirable, an assertion that (given ψ), the action α is related to ϕ, an assertion that ψ.

Hughes A Semantics for Means-End Relations

slide-7
SLIDE 7

Means-end relations in PDL Additional topics

Practical Reasoning

Practical reasoning is concerned with actions to attain desired results. Typical practical syllogisms include premises: an assertion that some end ϕ is desirable, an assertion that (given ψ), the action α is related to ϕ, an assertion that ψ. The conclusion is an action or an intention.

Hughes A Semantics for Means-End Relations

slide-8
SLIDE 8

Means-end relations in PDL Additional topics

von Wright’s example

I want to make the hut habitable.

Hughes A Semantics for Means-End Relations

slide-9
SLIDE 9

Means-end relations in PDL Additional topics

von Wright’s example

I want to make the hut habitable. Unless I heat the hut, it will not be habitable.

Hughes A Semantics for Means-End Relations

slide-10
SLIDE 10

Means-end relations in PDL Additional topics

von Wright’s example

I want to make the hut habitable. Unless I heat the hut, it will not be habitable. Therefore I must heat the hut.

Hughes A Semantics for Means-End Relations

slide-11
SLIDE 11

Means-end relations in PDL Additional topics

von Wright’s example

I want to make the hut habitable. Unless I heat the hut, it will not be habitable. Therefore I must heat the hut. Expression of an agent’s desire,

Hughes A Semantics for Means-End Relations

slide-12
SLIDE 12

Means-end relations in PDL Additional topics

von Wright’s example

I want to make the hut habitable. Unless I heat the hut, it will not be habitable. Therefore I must heat the hut. Expression of an agent’s desire, A necessary means-end relation,

Hughes A Semantics for Means-End Relations

slide-13
SLIDE 13

Means-end relations in PDL Additional topics

von Wright’s example

I want to make the hut habitable. Unless I heat the hut, it will not be habitable. Therefore I must heat the hut. Expression of an agent’s desire, A necessary means-end relation, Concludes in a necessary action.

Hughes A Semantics for Means-End Relations

slide-14
SLIDE 14

Means-end relations in PDL Additional topics

von Wright’s example

I want to make the hut habitable. Unless I heat the hut, it will not be habitable. Therefore I must heat the hut. Expression of an agent’s desire, A necessary means-end relation, Concludes in a necessary action. Note: distinct premises

Hughes A Semantics for Means-End Relations

slide-15
SLIDE 15

Means-end relations in PDL Additional topics

von Wright’s example

I want to make the hut habitable. Unless I heat the hut, it will not be habitable. Therefore I must heat the hut. Evaluation: How to evaluate the syllogism?

Hughes A Semantics for Means-End Relations

slide-16
SLIDE 16

Means-end relations in PDL Additional topics

von Wright’s example

I want to make the hut habitable. Unless I heat the hut, it will not be habitable. Therefore I must heat the hut. Evaluation: How to evaluate the syllogism? How do the premises make the conclusion necessary?

Hughes A Semantics for Means-End Relations

slide-17
SLIDE 17

Means-end relations in PDL Additional topics

von Wright’s example

I want to make the hut habitable. Unless I heat the hut, it will not be habitable. Therefore I must heat the hut. Evaluation: How to evaluate the syllogism? How do the premises make the conclusion necessary? For this, we need to know the meaning of the premises.

Hughes A Semantics for Means-End Relations

slide-18
SLIDE 18

Means-end relations in PDL Additional topics

Our project

Aim: Formal semantics for means-end relations

Hughes A Semantics for Means-End Relations

slide-19
SLIDE 19

Means-end relations in PDL Additional topics

Our project

Aim: Formal semantics for means-end relations Clarify means-end relations in practical syllogisms.

Hughes A Semantics for Means-End Relations

slide-20
SLIDE 20

Means-end relations in PDL Additional topics

Our project

Aim: Formal semantics for means-end relations Clarify means-end relations in practical syllogisms. Approximates natural language uses.

Hughes A Semantics for Means-End Relations

slide-21
SLIDE 21

Means-end relations in PDL Additional topics

Our project

Aim: Formal semantics for means-end relations Clarify means-end relations in practical syllogisms. Approximates natural language uses. Distinguishes sufficient and necessary means.

Hughes A Semantics for Means-End Relations

slide-22
SLIDE 22

Means-end relations in PDL Additional topics

Our project

Aim: Formal semantics for means-end relations Clarify means-end relations in practical syllogisms. Approximates natural language uses. Distinguishes sufficient and necessary means. Icing: Should be extensible to:

Hughes A Semantics for Means-End Relations

slide-23
SLIDE 23

Means-end relations in PDL Additional topics

Our project

Aim: Formal semantics for means-end relations Clarify means-end relations in practical syllogisms. Approximates natural language uses. Distinguishes sufficient and necessary means. Icing: Should be extensible to: include objects-as-means

Hughes A Semantics for Means-End Relations

slide-24
SLIDE 24

Means-end relations in PDL Additional topics

Our project

Aim: Formal semantics for means-end relations Clarify means-end relations in practical syllogisms. Approximates natural language uses. Distinguishes sufficient and necessary means. Icing: Should be extensible to: include objects-as-means include conditional relations

Hughes A Semantics for Means-End Relations

slide-25
SLIDE 25

Means-end relations in PDL Additional topics

Our project

Aim: Formal semantics for means-end relations Clarify means-end relations in practical syllogisms. Approximates natural language uses. Distinguishes sufficient and necessary means. Icing: Should be extensible to: include objects-as-means include conditional relations include efficacy and probabilistic outcomes

Hughes A Semantics for Means-End Relations

slide-26
SLIDE 26

Means-end relations in PDL Additional topics

Outline

1

Means-end relations in PDL A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Hughes A Semantics for Means-End Relations

slide-27
SLIDE 27

Means-end relations in PDL Additional topics

Outline

1

Means-end relations in PDL A brief overview of PDL Sufficient means-end relations Necessary means-end relations

2

Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Hughes A Semantics for Means-End Relations

slide-28
SLIDE 28

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Outline

1

Means-end relations in PDL A brief overview of PDL Sufficient means-end relations Necessary means-end relations

2

Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Hughes A Semantics for Means-End Relations

slide-29
SLIDE 29

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Conceptual starting points

An end is a condition to be realized.

Hughes A Semantics for Means-End Relations

slide-30
SLIDE 30

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Conceptual starting points

a n e n d Think possible worlds! An end is a condition to be realized.

Hughes A Semantics for Means-End Relations

slide-31
SLIDE 31

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Conceptual starting points

a n e n d

You are here.

Think possible worlds! An end is a condition to be realized.

Hughes A Semantics for Means-End Relations

slide-32
SLIDE 32

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Conceptual starting points

a n e n d Think possible worlds! An end is a condition to be realized. A means is a way of realizing the condition.

Hughes A Semantics for Means-End Relations

slide-33
SLIDE 33

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Conceptual starting points

a n e n d Think possible worlds! Think transitions! An end is a condition to be realized. A means is a way of realizing the condition.

Hughes A Semantics for Means-End Relations

slide-34
SLIDE 34

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Conceptual starting points

a n e n d Think possible worlds! Think transitions! An end is a condition to be realized. A means is a way of realizing the condition. Thus: an end is a formula;

Hughes A Semantics for Means-End Relations

slide-35
SLIDE 35

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Conceptual starting points

a n e n d Think possible worlds! Think transitions! An end is a condition to be realized. A means is a way of realizing the condition. Thus: an end is a formula; a means is an action;

Hughes A Semantics for Means-End Relations

slide-36
SLIDE 36

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Conceptual starting points

a n e n d Think possible worlds! Think transitions! An end is a condition to be realized. A means is a way of realizing the condition. Thus: an end is a formula; a means is an action; Propositional Dynamic Logic is a natural setting.

Hughes A Semantics for Means-End Relations

slide-37
SLIDE 37

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

PDL syntax

Propositional Dynamic Logic is a logic of actions.

Hughes A Semantics for Means-End Relations

slide-38
SLIDE 38

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

PDL syntax

Propositional Dynamic Logic is a logic of actions. Basic types: a set act of actions,

Hughes A Semantics for Means-End Relations

slide-39
SLIDE 39

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

PDL syntax

Propositional Dynamic Logic is a logic of actions. Basic types: a set act of actions,

Closed under:

sequential composition α; β non-deterministic choice α ∪ β

Hughes A Semantics for Means-End Relations

slide-40
SLIDE 40

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

PDL syntax

Propositional Dynamic Logic is a logic of actions. Basic types: a set act of actions,

Closed under:

sequential composition α; β non-deterministic choice α ∪ β

a set prop of propositions.

Hughes A Semantics for Means-End Relations

slide-41
SLIDE 41

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

PDL syntax

Propositional Dynamic Logic is a logic of actions. Basic types: a set act of actions,

Closed under:

sequential composition α; β non-deterministic choice α ∪ β

a set prop of propositions.

Closed under:

boolean connectives, dynamic operators [α]ϕ, αϕ.

Hughes A Semantics for Means-End Relations

slide-42
SLIDE 42

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

PDL syntax

Propositional Dynamic Logic is a logic of actions. Basic types: a set act of actions,

Closed under:

sequential composition α; β non-deterministic choice α ∪ β

a set prop of propositions.

Closed under:

boolean connectives, dynamic operators [α]ϕ, αϕ.

Intuitions: [α]ϕ: after doing α, ϕ will hold.

Hughes A Semantics for Means-End Relations

slide-43
SLIDE 43

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

PDL syntax

Propositional Dynamic Logic is a logic of actions. Basic types: a set act of actions,

Closed under:

sequential composition α; β non-deterministic choice α ∪ β

a set prop of propositions.

Closed under:

boolean connectives, dynamic operators [α]ϕ, αϕ.

Intuitions: [α]ϕ: after doing α, ϕ will hold. αϕ: after doing α, ϕ might hold.

Hughes A Semantics for Means-End Relations

slide-44
SLIDE 44

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

PDL semantics

α α α α

Possible world semantics with transition systems for each action α.

Hughes A Semantics for Means-End Relations

slide-45
SLIDE 45

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

PDL semantics

α α α α

Possible world semantics with transition systems for each action α. w

α

w′ means:

  • ne can reach w′ by doing α in w.

Hughes A Semantics for Means-End Relations

slide-46
SLIDE 46

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

PDL semantics

P [ α ] P

α α α α

Possible world semantics with transition systems for each action α. w

α

w′ means:

  • ne can reach w′ by doing α in w.

w | = [α]ϕ iff ∀w

α

w′ . w′ |

= ϕ.

Hughes A Semantics for Means-End Relations

slide-47
SLIDE 47

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

PDL semantics

Q

  • β
  • Q

β β β

Possible world semantics with transition systems for each action α. w

α

w′ means:

  • ne can reach w′ by doing α in w.

w | = [α]ϕ iff ∀w

α

w′ . w′ |

= ϕ. w | = αϕ iff ∃w

α

w′ . w′ |

= ϕ.

Hughes A Semantics for Means-End Relations

slide-48
SLIDE 48

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Weakly and strongly sufficient means

A sufficient means is an action α that can realize one’s end ϕ.

Hughes A Semantics for Means-End Relations

slide-49
SLIDE 49

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Weakly and strongly sufficient means

A sufficient means is an action α that can realize one’s end ϕ. Two interpretations: ϕ

α α

Weak: α might realize ϕ.

Hughes A Semantics for Means-End Relations

slide-50
SLIDE 50

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Weakly and strongly sufficient means

A sufficient means is an action α that can realize one’s end ϕ. Two interpretations: ϕ

α α

ϕ

α α

Weak: α might realize ϕ. Strong: α will realize ϕ.

Hughes A Semantics for Means-End Relations

slide-51
SLIDE 51

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Weakly and strongly sufficient means

A sufficient means is an action α that can realize one’s end ϕ. Two interpretations: ϕ

α α

ϕ

α α

Weak: α might realize ϕ. Strong: α will realize ϕ. w | = αϕ w | = [α]ϕ ∧ α⊤

Hughes A Semantics for Means-End Relations

slide-52
SLIDE 52

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Weakly and strongly sufficient means

A sufficient means is an action α that can realize one’s end ϕ. Two interpretations: ϕ

α α

ϕ

α α

Weak: α might realize ϕ. Strong: α will realize ϕ. w | = αϕ w | = [α]ϕ ∧ α⊤ α can be done.

Hughes A Semantics for Means-End Relations

slide-53
SLIDE 53

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Weakly and strongly sufficient means

A sufficient means is an action α that can realize one’s end ϕ. Two interpretations: ϕ

α α

ϕ

α α

Weak: α might realize ϕ. Strong: α will realize ϕ. w | = αϕ w | = [α]ϕ ∧ α⊤ α can be done. Caveat: This definition omits relevance.

Hughes A Semantics for Means-End Relations

slide-54
SLIDE 54

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means-end relations

Necessary means seem simpler in practical syllogisms.

Hughes A Semantics for Means-End Relations

slide-55
SLIDE 55

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means-end relations

Necessary means seem simpler in practical syllogisms. The consequence of a necessary means seems well-motivated.

Hughes A Semantics for Means-End Relations

slide-56
SLIDE 56

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

von Wright’s example

I want to make the hut habitable. Unless I heat the hut, it will not be habitable. Therefore I must heat the hut. Expression of an agent’s desire, A necessary means-end relation, Concludes in a necessary action.

Hughes A Semantics for Means-End Relations

slide-57
SLIDE 57

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means-end relations

Necessary means seem simpler in practical syllogisms. The consequence of a necessary means seems well-motivated. But the semantics for necessary means are subtle.

Hughes A Semantics for Means-End Relations

slide-58
SLIDE 58

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means-end relations

Necessary means seem simpler in practical syllogisms. The consequence of a necessary means seems well-motivated. But the semantics for necessary means are subtle. Necessary means (roughly): If α is a necessary means to ϕ, then ϕ can be realized and

Hughes A Semantics for Means-End Relations

slide-59
SLIDE 59

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means-end relations

Necessary means seem simpler in practical syllogisms. The consequence of a necessary means seems well-motivated. But the semantics for necessary means are subtle. Necessary means (roughly): If α is a necessary means to ϕ, then ϕ can be realized and any weakly sufficient means to ϕ involves doing α.

Hughes A Semantics for Means-End Relations

slide-60
SLIDE 60

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means and counterexamples

Necessary means (roughly): If α is a necessary means to ϕ, then ϕ can be realized and any weakly sufficient means to ϕ involves doing α. Note: Necessary does not imply sufficient.

Hughes A Semantics for Means-End Relations

slide-61
SLIDE 61

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means and counterexamples

Necessary means (roughly): If α is a necessary means to ϕ, then ϕ can be realized and any weakly sufficient means to ϕ involves doing α. Note: Necessary does not imply sufficient. Necessary does not mean immediately necessary.

Hughes A Semantics for Means-End Relations

slide-62
SLIDE 62

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means and counterexamples

Necessary means (roughly): If α is a necessary means to ϕ, then ϕ can be realized and any weakly sufficient means to ϕ involves doing α. Note: Necessary does not imply sufficient. Necessary does not mean immediately necessary. Key unanalyzed term: “involves”

Hughes A Semantics for Means-End Relations

slide-63
SLIDE 63

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Involvement

Write β α for: β involves α.

Hughes A Semantics for Means-End Relations

slide-64
SLIDE 64

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Involvement

Write β α for: β involves α. Loosely: β α means by doing β, one also “does” α.

Hughes A Semantics for Means-End Relations

slide-65
SLIDE 65

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Involvement

Write β α for: β involves α. Loosely: β α means by doing β, one also “does” α. If β α, then the sufficiency of β does not refute the necessity of α.

Hughes A Semantics for Means-End Relations

slide-66
SLIDE 66

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Involvement

Write β α for: β involves α. Loosely: β α means by doing β, one also “does” α. If β α, then the sufficiency of β does not refute the necessity of α. Basic properties: is a pre-order.

Hughes A Semantics for Means-End Relations

slide-67
SLIDE 67

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Involvement

Write β α for: β involves α. Loosely: β α means by doing β, one also “does” α. If β α, then the sufficiency of β does not refute the necessity of α. Basic properties: is a pre-order. Non-deterministic choice ∪ is the join for .

Hughes A Semantics for Means-End Relations

slide-68
SLIDE 68

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Involvement

Write β α for: β involves α. Loosely: β α means by doing β, one also “does” α. If β α, then the sufficiency of β does not refute the necessity of α. Basic properties: is a pre-order. Non-deterministic choice ∪ is the join for . If β α, then β; γ α; γ and γ; β γ; α.

Hughes A Semantics for Means-End Relations

slide-69
SLIDE 69

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Involvement

Write β α for: β involves α. Loosely: β α means by doing β, one also “does” α. If β α, then the sufficiency of β does not refute the necessity of α. Basic properties: is a pre-order. Non-deterministic choice ∪ is the join for . If β α, then β; γ α; γ and γ; β γ; α. α; β α and α; β β.

Hughes A Semantics for Means-End Relations

slide-70
SLIDE 70

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means: summarized

α is a necessary means to ϕ in w iff ϕ is attainable in w;

Hughes A Semantics for Means-End Relations

slide-71
SLIDE 71

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means: summarized

α is a necessary means to ϕ in w iff ϕ is attainable in w; there is no β such that

w | = βϕ,

Hughes A Semantics for Means-End Relations

slide-72
SLIDE 72

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means: summarized

α is a necessary means to ϕ in w iff ϕ is attainable in w; there is no β such that

w | = βϕ, β α and

Hughes A Semantics for Means-End Relations

slide-73
SLIDE 73

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means: summarized

α is a necessary means to ϕ in w iff ϕ is attainable in w; there is no β such that

w | = βϕ, β α and β is ∪-free

Hughes A Semantics for Means-End Relations

slide-74
SLIDE 74

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means: summarized

α is a necessary means to ϕ in w iff ϕ is attainable in w; there is no β such that

w | = βϕ, β α and β is ∪-free

(Annoying technical detail)

Hughes A Semantics for Means-End Relations

slide-75
SLIDE 75

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means: summarized

α is a necessary means to ϕ in w iff ϕ is attainable in w; there is no β such that

w | = βϕ, β α and β is ∪-free

(Annoying technical detail) Thus, α is necessary iff ϕ is attainable and

Hughes A Semantics for Means-End Relations

slide-76
SLIDE 76

Means-end relations in PDL Additional topics A brief overview of PDL Sufficient means-end relations Necessary means-end relations

Necessary means: summarized

α is a necessary means to ϕ in w iff ϕ is attainable in w; there is no β such that

w | = βϕ, β α and β is ∪-free

(Annoying technical detail) Thus, α is necessary iff ϕ is attainable and any (∪-free) weakly sufficient means to ϕ involves α.

Hughes A Semantics for Means-End Relations

slide-77
SLIDE 77

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Outline

1

Means-end relations in PDL A brief overview of PDL Sufficient means-end relations Necessary means-end relations

2

Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Hughes A Semantics for Means-End Relations

slide-78
SLIDE 78

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Objects as means

A bottle-opener is a means to liquid refreshment.

Hughes A Semantics for Means-End Relations

slide-79
SLIDE 79

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Objects as means

A bottle-opener is a means to liquid refreshment. But means are actions!

Hughes A Semantics for Means-End Relations

slide-80
SLIDE 80

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Objects as means

A bottle-opener is a means to liquid refreshment. But means are actions! How to represent objects-as-means in PDL?

Hughes A Semantics for Means-End Relations

slide-81
SLIDE 81

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Objects as means

A bottle-opener is a means to liquid refreshment. But means are actions! How to represent objects-as-means in PDL? Step 1: Introduce actions “use o”.

Hughes A Semantics for Means-End Relations

slide-82
SLIDE 82

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Objects as means

A bottle-opener is a means to liquid refreshment. But means are actions! How to represent objects-as-means in PDL? Step 1: Introduce actions “use o”. Problem: Keys lock and unlock doors.

Hughes A Semantics for Means-End Relations

slide-83
SLIDE 83

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Objects as means

A bottle-opener is a means to liquid refreshment. But means are actions! How to represent objects-as-means in PDL? Step 1: Introduce actions “use o”. Problem: Keys lock and unlock doors. In PDL: [α]ϕ ∧ [α]¬ϕ implies [α](ϕ ∧ ¬ϕ).

Hughes A Semantics for Means-End Relations

slide-84
SLIDE 84

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Objects as means

A bottle-opener is a means to liquid refreshment. But means are actions! How to represent objects-as-means in PDL? Step 1: Introduce actions “use o”. Problem: Keys lock and unlock doors. In PDL: [α]ϕ ∧ [α]¬ϕ implies [α](ϕ ∧ ¬ϕ). Step 2: Move to minimal models.

Hughes A Semantics for Means-End Relations

slide-85
SLIDE 85

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Objects as means

A bottle-opener is a means to liquid refreshment. But means are actions! How to represent objects-as-means in PDL? Step 1: Introduce actions “use o”. Problem: Keys lock and unlock doors. In PDL: [α]ϕ ∧ [α]¬ϕ implies [α](ϕ ∧ ¬ϕ). Step 2: Move to minimal models. Give up distributivity.

Hughes A Semantics for Means-End Relations

slide-86
SLIDE 86

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Objects as means

A bottle-opener is a means to liquid refreshment. But means are actions! How to represent objects-as-means in PDL? Step 1: Introduce actions “use o”. Problem: Keys lock and unlock doors. In PDL: [α]ϕ ∧ [α]¬ϕ implies [α](ϕ ∧ ¬ϕ). Step 2: Move to minimal models. Give up distributivity. Gain richer sense of “using”

  • bjects.

Hughes A Semantics for Means-End Relations

slide-87
SLIDE 87

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

PDL means-end relations are local relations

Our definition In w, m is a means to ϕ iff w | = [m]ϕ & mTrue. This is a very narrow sense of means-end relation.

Hughes A Semantics for Means-End Relations

slide-88
SLIDE 88

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

PDL means-end relations are local relations

Our definition In w, m is a means to ϕ iff w | = [m]ϕ & mTrue. This is a very narrow sense of means-end relation. Example “Riding the train is a means to reaching Delft.”

Hughes A Semantics for Means-End Relations

slide-89
SLIDE 89

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

PDL means-end relations are local relations

Our definition In w, m is a means to ϕ iff w | = [m]ϕ & mTrue. This is a very narrow sense of means-end relation. Example “Riding the train is a means to reaching Delft.” Do we mean this is true just in this world?

Hughes A Semantics for Means-End Relations

slide-90
SLIDE 90

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

PDL means-end relations are local relations

Our definition In w, m is a means to ϕ iff w | = [m]ϕ & mTrue. This is a very narrow sense of means-end relation. Example “Riding the train is a means to reaching Delft.” Do we mean this is true just in this world? every world?

Hughes A Semantics for Means-End Relations

slide-91
SLIDE 91

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

PDL means-end relations are local relations

Our definition In w, m is a means to ϕ iff w | = [m]ϕ & mTrue. This is a very narrow sense of means-end relation. Example “Riding the train is a means to reaching Delft.” Do we mean this is true just in this world? every world? every world in which we are in Eindhoven?

Hughes A Semantics for Means-End Relations

slide-92
SLIDE 92

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

PDL means-end relations are local relations

Our definition In w, m is a means to ϕ iff w | = [m]ϕ & mTrue. This is a very narrow sense of means-end relation. Example “Riding the train is a means to reaching Delft.” Do we mean this is true just in this world? every world? every world in which we are in Eindhoven? every “normal” world in which we are in Eindhoven?

Hughes A Semantics for Means-End Relations

slide-93
SLIDE 93

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Natural means-end relations are conditional

Example “Riding the train is a means to reaching Delft.” Natural means-end relations:

Hughes A Semantics for Means-End Relations

slide-94
SLIDE 94

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Natural means-end relations are conditional

Example “Riding the train is a means to reaching Delft.” Natural means-end relations: are not local

more general than just this world

Hughes A Semantics for Means-End Relations

slide-95
SLIDE 95

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Natural means-end relations are conditional

Example “Riding the train is a means to reaching Delft.” Natural means-end relations: are not local

more general than just this world

are not global

doesn’t express relation about every world

Hughes A Semantics for Means-End Relations

slide-96
SLIDE 96

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Natural means-end relations are conditional

Example “Riding the train is a means to reaching Delft.” Natural means-end relations: are not local

more general than just this world

are not global

doesn’t express relation about every world

are defeasible

relation is about normal expectations

Hughes A Semantics for Means-End Relations

slide-97
SLIDE 97

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Natural means-end relations are conditional

Example “Riding the train is a means to reaching Delft.” Natural means-end relations: are not local

more general than just this world

are not global

doesn’t express relation about every world

are defeasible

relation is about normal expectations

sometimes include preconditions

Hughes A Semantics for Means-End Relations

slide-98
SLIDE 98

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Natural means-end relations are conditional

Example “Riding the train is a means to reaching Delft.” Natural means-end relations: are not local

more general than just this world

are not global

doesn’t express relation about every world

are defeasible

relation is about normal expectations

sometimes include preconditions Solution: add a non-monotonic conditional operator to PDL.

Hughes A Semantics for Means-End Relations

slide-99
SLIDE 99

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Means distinguished by efficacy

Different means to a common end have different degrees of reliability.

Hughes A Semantics for Means-End Relations

slide-100
SLIDE 100

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Means distinguished by efficacy

Different means to a common end have different degrees of reliability. End: Get 12 points with one dart.

Hughes A Semantics for Means-End Relations

slide-101
SLIDE 101

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Means distinguished by efficacy

Different means to a common end have different degrees of reliability. End: Get 12 points with one dart. Three different means: Throw for 12.

Hughes A Semantics for Means-End Relations

slide-102
SLIDE 102

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Means distinguished by efficacy

Different means to a common end have different degrees of reliability. End: Get 12 points with one dart. Three different means: Throw for 12. Throw for double 6.

Hughes A Semantics for Means-End Relations

slide-103
SLIDE 103

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Means distinguished by efficacy

Different means to a common end have different degrees of reliability. End: Get 12 points with one dart. Three different means: Throw for 12. Throw for double 6. Throw for triple 4.

Hughes A Semantics for Means-End Relations

slide-104
SLIDE 104

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Means distinguished by efficacy

Different means to a common end have different degrees of reliability. End: Get 12 points with one dart. Three different means: Throw for 12. Throw for double 6. Throw for triple 4. Efficacy: The degree of reliability of a means to an end.

Hughes A Semantics for Means-End Relations

slide-105
SLIDE 105

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

From non-determinism to probabilities

Q

α α β β

Efficacy is a measure of likelihoods.

Hughes A Semantics for Means-End Relations

slide-106
SLIDE 106

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

From non-determinism to probabilities

Q

α α β β

Efficacy is a measure of likelihoods. PDL includes non-determinism, not probabilities.

Hughes A Semantics for Means-End Relations

slide-107
SLIDE 107

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

From non-determinism to probabilities

Q

α , . 2 α 0.8 β , . 9 β 0.1

Efficacy is a measure of likelihoods. PDL includes non-determinism, not probabilities. Fix (semantic): use probabilistic transition structures.

Hughes A Semantics for Means-End Relations

slide-108
SLIDE 108

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

From non-determinism to probabilities

Q

α , . 2 α 0.8 β , . 9 β 0.1

Efficacy is a measure of likelihoods. PDL includes non-determinism, not probabilities. Fix (semantic): use probabilistic transition structures. w

α x

w′ means that

doing α in w has probability x

  • f resulting in w′.

Hughes A Semantics for Means-End Relations

slide-109
SLIDE 109

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

From non-determinism to probabilities

Q

α , . 2 α 0.8 β , . 9 β 0.1

Efficacy is a measure of likelihoods. PDL includes non-determinism, not probabilities. Fix (semantic): use probabilistic transition structures. w

α x

w′ means that

doing α in w has probability x

  • f resulting in w′.

Interpret α as a fuzzy operator.

Hughes A Semantics for Means-End Relations

slide-110
SLIDE 110

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Reliability as a fuzzy proposition

  • α
  • Q

Q

α α α

“Reliably” is a vague operator.

Hughes A Semantics for Means-End Relations

slide-111
SLIDE 111

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Reliability as a fuzzy proposition

  • α
  • Q

Q

α α α

“Reliably” is a vague operator. In PDL: αϕ ⇔ α will possibly realize ϕ

Hughes A Semantics for Means-End Relations

slide-112
SLIDE 112

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Reliability as a fuzzy proposition

  • α
  • Q

Q

α 1 α 0.5 α . 5

“Reliably” is a vague operator. In PDL: αϕ ⇔ α will possibly realize ϕ In fuzzy PDL: αϕ ⇔ α will probably realize ϕ

Hughes A Semantics for Means-End Relations

slide-113
SLIDE 113

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Reliability as a fuzzy proposition

  • α
  • Q

Q

α 1 α 0.5 α . 5

“Reliably” is a vague operator. In PDL: αϕ ⇔ α will possibly realize ϕ In fuzzy PDL: αϕ ⇔ α will probably realize ϕ ⇔ α reliably realizes ϕ

Hughes A Semantics for Means-End Relations

slide-114
SLIDE 114

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Reliability as a fuzzy proposition

  • α
  • Q

Q

α 1 α 0.5 α . 5

“Reliably” is a vague operator. In PDL: αϕ ⇔ α will possibly realize ϕ In fuzzy PDL: αϕ ⇔ α will probably realize ϕ ⇔ α reliably realizes ϕ Like decision theory, we use averages for expected outcomes.

Hughes A Semantics for Means-End Relations

slide-115
SLIDE 115

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Reliability as a fuzzy proposition

  • α
  • Q

Q

α 1 α 0.5 α . 5

“Reliably” is a vague operator. In PDL: αϕ ⇔ α will possibly realize ϕ In fuzzy PDL: αϕ ⇔ α will probably realize ϕ ⇔ α reliably realizes ϕ Like decision theory, we use averages for expected outcomes. Unlike decision theory, there are no utilities involved.

Hughes A Semantics for Means-End Relations

slide-116
SLIDE 116

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Reliability as a fuzzy proposition

  • α
  • Q

Q

α 1 α 0.5 α . 5

“Reliably” is a vague operator. In PDL: αϕ ⇔ α will possibly realize ϕ In fuzzy PDL: αϕ ⇔ α will probably realize ϕ ⇔ α reliably realizes ϕ Like decision theory, we use averages for expected outcomes. Unlike decision theory, there are no utilities involved. Elegant treatment of complex ends, like αϕ ∧ βψ.

Hughes A Semantics for Means-End Relations

slide-117
SLIDE 117

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Concluding remarks

Summary: Semantics for means-end relations

Hughes A Semantics for Means-End Relations

slide-118
SLIDE 118

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Concluding remarks

Summary: Semantics for means-end relations

Sufficient and necessary

Hughes A Semantics for Means-End Relations

slide-119
SLIDE 119

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Concluding remarks

Summary: Semantics for means-end relations

Sufficient and necessary Extensions include objects, conditionals, fuzziness

Hughes A Semantics for Means-End Relations

slide-120
SLIDE 120

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Concluding remarks

Summary: Semantics for means-end relations

Sufficient and necessary Extensions include objects, conditionals, fuzziness Can be applied for semantics of functions

Hughes A Semantics for Means-End Relations

slide-121
SLIDE 121

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Concluding remarks

Summary: Semantics for means-end relations

Sufficient and necessary Extensions include objects, conditionals, fuzziness Can be applied for semantics of functions

Thanks and references: Co-authors: Albert Esterline, Bahram Kimiaghalam, Peter Kroes, Sjoerd Zwart

Hughes A Semantics for Means-End Relations

slide-122
SLIDE 122

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Concluding remarks

Summary: Semantics for means-end relations

Sufficient and necessary Extensions include objects, conditionals, fuzziness Can be applied for semantics of functions

Thanks and references: Co-authors: Albert Esterline, Bahram Kimiaghalam, Peter Kroes, Sjoerd Zwart See http://phiwumbda.org/~jesse/papers/.

Hughes A Semantics for Means-End Relations

slide-123
SLIDE 123

Means-end relations in PDL Additional topics Objects as means Conditional means-end relations Efficacy and fuzzy PDL

Concluding remarks

Summary: Semantics for means-end relations

Sufficient and necessary Extensions include objects, conditionals, fuzziness Can be applied for semantics of functions

Thanks and references: Co-authors: Albert Esterline, Bahram Kimiaghalam, Peter Kroes, Sjoerd Zwart See http://phiwumbda.org/~jesse/papers/.

Thank you.

Hughes A Semantics for Means-End Relations

slide-124
SLIDE 124

Non-monotonicity Extra details on fuzzy PDL

Outline

3

Non-monotonicity

4

Extra details on fuzzy PDL Probability is not fuzziness Fuzzy ends

Hughes A Semantics for Means-End Relations

slide-125
SLIDE 125

Non-monotonicity Extra details on fuzzy PDL

Reevaluating material implication

(or “Why means-end reasoning is hard”)

A simple derivation: If I had money, she would marry me.

Hughes A Semantics for Means-End Relations

slide-126
SLIDE 126

Non-monotonicity Extra details on fuzzy PDL

Reevaluating material implication

(or “Why means-end reasoning is hard”)

A simple derivation: If I had money, she would marry me. If I robbed her, I would have money.

Hughes A Semantics for Means-End Relations

slide-127
SLIDE 127

Non-monotonicity Extra details on fuzzy PDL

Reevaluating material implication

(or “Why means-end reasoning is hard”)

A simple derivation: If I had money, she would marry me. If I robbed her, I would have money. ∴ If I robbed her, she would marry me.

Hughes A Semantics for Means-End Relations

slide-128
SLIDE 128

Non-monotonicity Extra details on fuzzy PDL

Reevaluating material implication

(or “Why means-end reasoning is hard”)

A simple derivation: If I had money, she would marry me. If I robbed her, I would have money. ∴ If I robbed her, she would marry me. Bad argument: money → [propose]marry

Hughes A Semantics for Means-End Relations

slide-129
SLIDE 129

Non-monotonicity Extra details on fuzzy PDL

Reevaluating material implication

(or “Why means-end reasoning is hard”)

A simple derivation: If I had money, she would marry me. If I robbed her, I would have money. ∴ If I robbed her, she would marry me. Bad argument: money → [propose]marry [rob]money

Hughes A Semantics for Means-End Relations

slide-130
SLIDE 130

Non-monotonicity Extra details on fuzzy PDL

Reevaluating material implication

(or “Why means-end reasoning is hard”)

A simple derivation: If I had money, she would marry me. If I robbed her, I would have money. ∴ If I robbed her, she would marry me. Bad argument: money → [propose]marry [rob]money ∴ [rob; propose]marry.

Hughes A Semantics for Means-End Relations

slide-131
SLIDE 131

Non-monotonicity Extra details on fuzzy PDL

Reevaluating material implication

(or “Why means-end reasoning is hard”)

A simple derivation: If I had money, she would marry me. If I robbed her, I would have money. ∴ If I robbed her, she would marry me. Bad argument: Good argument: money → [propose]marry Loaded → [fire]Started [rob]money [load]Loaded ∴ [rob; propose]marry. ∴ [load; fire]Started.

Hughes A Semantics for Means-End Relations

slide-132
SLIDE 132

Non-monotonicity Extra details on fuzzy PDL

Reevaluating material implication

(or “Why means-end reasoning is hard”)

A simple derivation: If I had money, she would marry me. If I robbed her, I would have money. ∴ If I robbed her, she would marry me. Bad argument: Good argument: money → [propose]marry Loaded → [fire]Started [rob]money [load]Loaded ∴ [rob; propose]marry. ∴ [load; fire]Started. Problem: If I rob her, she will hate me and (money & HATE) → [propose]marry.

Hughes A Semantics for Means-End Relations

slide-133
SLIDE 133

Non-monotonicity Extra details on fuzzy PDL

Our conditional should be non-monotonic

Non-monotonicity money → [propose]marry but (money & HATE) → [propose]marry.

Hughes A Semantics for Means-End Relations

slide-134
SLIDE 134

Non-monotonicity Extra details on fuzzy PDL

Our conditional should be non-monotonic

Non-monotonicity money → [propose]marry but (money & HATE) → [propose]marry. Solutions: money → [propose]marry just isn’t true.

Hughes A Semantics for Means-End Relations

slide-135
SLIDE 135

Non-monotonicity Extra details on fuzzy PDL

Our conditional should be non-monotonic

Non-monotonicity money → [propose]marry but (money & HATE) → [propose]marry. Solutions: money → [propose]marry just isn’t true.

Advantage: Get to keep material implication.

Hughes A Semantics for Means-End Relations

slide-136
SLIDE 136

Non-monotonicity Extra details on fuzzy PDL

Our conditional should be non-monotonic

Non-monotonicity money → [propose]marry but (money & HATE) → [propose]marry. Solutions: money → [propose]marry just isn’t true.

Advantage: Get to keep material implication. Disadvantage: Sidesteps the hard bits.

Hughes A Semantics for Means-End Relations

slide-137
SLIDE 137

Non-monotonicity Extra details on fuzzy PDL

Our conditional should be non-monotonic

Non-monotonicity money → [propose]marry but (money & HATE) → [propose]marry. Solutions: money → [propose]marry just isn’t true.

Advantage: Get to keep material implication. Disadvantage: Sidesteps the hard bits.

Accept non-monotonicity and choose different semantics for →.

Hughes A Semantics for Means-End Relations

slide-138
SLIDE 138

Non-monotonicity Extra details on fuzzy PDL

Our conditional should be non-monotonic

Non-monotonicity money → [propose]marry but (money & HATE) → [propose]marry. Solutions: money → [propose]marry just isn’t true.

Advantage: Get to keep material implication. Disadvantage: Sidesteps the hard bits.

Accept non-monotonicity and choose different semantics for →.

Disadvantage: Makes reasoning about means hard.

Hughes A Semantics for Means-End Relations

slide-139
SLIDE 139

Non-monotonicity Extra details on fuzzy PDL

Our conditional should be non-monotonic

Non-monotonicity money → [propose]marry but (money & HATE) → [propose]marry. Solutions: money → [propose]marry just isn’t true.

Advantage: Get to keep material implication. Disadvantage: Sidesteps the hard bits.

Accept non-monotonicity and choose different semantics for →.

Disadvantage: Makes reasoning about means hard. Advantage: Makes reasoning about means hard.

Hughes A Semantics for Means-End Relations

slide-140
SLIDE 140

Non-monotonicity Extra details on fuzzy PDL

Our conditional should be non-monotonic

Non-monotonicity money → [propose]marry but (money & HATE) → [propose]marry. Solutions: money → [propose]marry just isn’t true.

Advantage: Get to keep material implication. Disadvantage: Sidesteps the hard bits.

Accept non-monotonicity and choose different semantics for →.

Disadvantage: Makes reasoning about means hard. Advantage: Makes reasoning about means hard.

Reasoning about means is hard.

Hughes A Semantics for Means-End Relations

slide-141
SLIDE 141

Non-monotonicity Extra details on fuzzy PDL Probability is not fuzziness Fuzzy ends

Outline

3

Non-monotonicity

4

Extra details on fuzzy PDL Probability is not fuzziness Fuzzy ends

Hughes A Semantics for Means-End Relations

slide-142
SLIDE 142

Non-monotonicity Extra details on fuzzy PDL Probability is not fuzziness Fuzzy ends

But probability = fuzziness. . .

Slogan: Probabilities and fuzziness are different.

Hughes A Semantics for Means-End Relations

slide-143
SLIDE 143

Non-monotonicity Extra details on fuzzy PDL Probability is not fuzziness Fuzzy ends

But probability = fuzziness. . .

Slogan: Probabilities and fuzziness are different. But one can use probabilities to define fuzzy predicates.

Hughes A Semantics for Means-End Relations

slide-144
SLIDE 144

Non-monotonicity Extra details on fuzzy PDL Probability is not fuzziness Fuzzy ends

But probability = fuzziness. . .

Slogan: Probabilities and fuzziness are different. But one can use probabilities to define fuzzy predicates. Hajek, et al., uses distributions on propositional formulas to define “Probably ϕ”.

Hughes A Semantics for Means-End Relations

slide-145
SLIDE 145

Non-monotonicity Extra details on fuzzy PDL Probability is not fuzziness Fuzzy ends

But probability = fuzziness. . .

Slogan: Probabilities and fuzziness are different. But one can use probabilities to define fuzzy predicates. Hajek, et al., uses distributions on propositional formulas to define “Probably ϕ”. Truth degrees “Probably ϕ”: P(ϕ) αϕ:

w′∈WP(w α

− → w′) · ϕ(w′)

Hughes A Semantics for Means-End Relations

slide-146
SLIDE 146

Non-monotonicity Extra details on fuzzy PDL Probability is not fuzziness Fuzzy ends

Fuzzy ends

An accidental advantage

Weapons are for causing harm.

Hughes A Semantics for Means-End Relations

slide-147
SLIDE 147

Non-monotonicity Extra details on fuzzy PDL Probability is not fuzziness Fuzzy ends

Fuzzy ends

An accidental advantage

Weapons are for causing harm. Examples: slingshot, nuke

Hughes A Semantics for Means-End Relations

slide-148
SLIDE 148

Non-monotonicity Extra details on fuzzy PDL Probability is not fuzziness Fuzzy ends

Fuzzy ends

An accidental advantage

H a r m Weapons are for causing harm. Examples: slingshot, nuke This end is fuzzy.

Hughes A Semantics for Means-End Relations

slide-149
SLIDE 149

Non-monotonicity Extra details on fuzzy PDL Probability is not fuzziness Fuzzy ends

Fuzzy ends

An accidental advantage

H a r m

s l i n g . 5 sling 0.5 n u k e 1

Weapons are for causing harm. Examples: slingshot, nuke This end is fuzzy. Fuzzy PDL allows for fuzzy ends. A nuke is more effective in causing harm than a slingshot. (Duh.)

Hughes A Semantics for Means-End Relations