# { Kevin T. Kelly, Hanti Lin } Carnegie Mellon University Responsive -ness CMU.

## Presentation on theme: "{ Kevin T. Kelly, Hanti Lin } Carnegie Mellon University Responsive -ness CMU."— Presentation transcript:

{ Kevin T. Kelly, Hanti Lin } Carnegie Mellon University Responsive -ness CMU

Probabilistic conditioning

Probabilistic conditioning Acceptance

Probabilistic conditioning Acceptance Propositional belief revision

Probabilistic conditioning Acceptance Propositional belief revision Acceptance

Probabilistic conditioning Acceptance Propositional belief revision Acceptance = Conditioning + acceptance = acceptance + revision

Acceptance Propositional belief revision Probabilistic conditioning

Acceptance Tie shoes? Probabilistic conditioning Eat breakfast? Get out of bed?

Acceptance Probabilistic conditioning Help! Bayes! Invest? Tie shoes? Eat breakfast? Get out of bed?

Acceptance Condition only once Tie shoes? Eat breakfast? Get out of bed? Invest?

Acceptance Thanks. Ill take it from here Tie shoes? Eat breakfast? Get out of bed? Invest? Condition only once TV?

Acceptance Repeated conditioning Tie shoes? Eat breakfast? Get out of bed? Invest? TV?

Acceptance Tie shoes? Eat breakfast? Get out of bed? Invest? Condition only once TV?

Steadiness = Just conjoin the new data with your old propositions if the two are consistent E B LMU

B C A

C A

A BC Yoav Shoham

A C

AC

LMU CMU

Inconsistency is accepted nowhere.

Every atom A is accepted over some open neighborhood.

There is an open neighborhood over which you accept a non-atom and nothing stronger. A v B

C If an atom is accepted, it continues to be accepted along the straight line to the corresponding corner.

C C C C C

Sensible = all four properties. C C C C C A v B

A v C A C B v C T B A v B A v C A C B v C T B A v B LMUCMU

No sensible acceptance rule is both steady and tracks conditioning. consumer designer Sorry. You cant have both.

A BC A A v B p p(.|A v B)

A BC A A v B p p(.|A v B) Accept A. Learn its consequence A v B. If you track, you retract A!

If you accept a hypothesis, dont retract it when you learn what it entails (i.e. predicts).

A v B A v C A B C B v C T 0.8 0.9

p A B

A B B p p(.|B)

A B A p

A B A B T p You will accept A v B no matter whether B or B is learned. But if you track, you dont accept A v B.

Accept a hypothesis, if you will accept it no matter whether E is learned or E is learned.

The CMU rule + Shoham revision (non-steady) satisfies: sensible tracks conditioning avoids both new paradoxes

Shoham revision sensible tracks conditioning Implies CMU rule + avoidance of the 2 new paradoxes.

Nogot Nobody Somebody Gettier case Havit = the Truth

Havit = the Truth Nogot Nobody Somebody

Havit Nogot Nobody Somebody is retracted but not refuted.

Havit Nogot Nobody Somebody

Havit NogotHavit Nobody Nogot Nobody

Trust what you accepted Re-examine your reasons Havit NogotHavit Nobody Nogot Nobody

(0, 1, 0) (0, 0, 1) (1, 0, 0) (1/3, 1/3, 1/3) Logic Geometry A C B Acpt

A BC

A BC

A BC

111 100 010001 000 011 110101

111 100 010001 000 011 110101

111 100 010001 000 011 110101

111 100 010001 000 011 110101

111 100 001 000 011 110 010 101

Close classical logic under Partial negation

Logical Closure = Sub-crystals

Acpt

The CMU rule is the only rule that preserves logical structure (entailment, disjunction and consistent conjunction). Acpt

The CMU rule + Shoham revision satisfies sensible tracks conditioning avoids both new paradoxes represents no-false-lemma Gettier cases unique geo-logical representation

The CMU rule + Shoham revision satisfies sensible tracks conditioning avoids both new paradoxes represents no-false-lemma Gettier cases unique geo-logical representation

Similar presentations