Conclusion Franois Schwarzentruber cole Normale Suprieure Rennes - - PowerPoint PPT Presentation

▶
conclusion
SMART_READER_LITE
LIVE PREVIEW

Conclusion Franois Schwarzentruber cole Normale Suprieure Rennes - - PowerPoint PPT Presentation

Oct 29, 2022 338 likes •527 views

Conclusion Topics not covered Perspectives Conclusion Franois Schwarzentruber cole Normale Suprieure Rennes August 6, 2019 1 / 18 Conclusion Topics not covered Perspectives Outline Conclusion 1 2 Topics not covered 3

slide-1
SLIDE 1

Conclusion Topics not covered Perspectives

Conclusion

François Schwarzentruber

École Normale Supérieure Rennes

August 6, 2019

1 / 18

slide-2
SLIDE 2

Conclusion Topics not covered Perspectives

Outline

1

Conclusion

2

Topics not covered

3

Perspectives

2 / 18

slide-3
SLIDE 3

Conclusion Topics not covered Perspectives

Conclusion

Notions Epistemic logic Syntax, Semantics, Succinctness, Model checking, Satisfability Knowledge and seeing Abstraction Knowledge and time Interaction Dynamic epistemic logic Automatic structures VS Turing- complete, no knowledge about the strategies of others Knowledge-based programs Common knowledge of the strategies of

  • thers

3 / 18

slide-4
SLIDE 4

Conclusion Topics not covered Perspectives

Outline

1

Conclusion

2

Topics not covered

3

Perspectives

4 / 18

slide-5
SLIDE 5

Conclusion Topics not covered Perspectives

Other topics not covered

Belief revision, plausibility models [Baltag et al. Chap. 7 of Handbook of epistemic logic] Probabilistic dynamic epistemic logic Distributed systems and interpreted systems. Modeling protocols. Proof theory. Soundness and completeness of axiomatization. Finite model property. Bisimilation. Bisimilation contraction.

5 / 18

slide-6
SLIDE 6

Conclusion Topics not covered Perspectives

Outline

1

Conclusion

2

Topics not covered

3

Perspectives

6 / 18

slide-7
SLIDE 7

Conclusion Topics not covered Perspectives

Perspectives

Provide efficient algorithms for epistemic planning Synthesis Knowledge-based programs (mix of Reinforcement Learning and tracking the emergence of epistemic reasoning?) Face the logical omniscience problem

7 / 18

slide-8
SLIDE 8

Conclusion Topics not covered Perspectives

Limited belief

Issue when interacting with humans: logical omniscience Because knowledge computation not modeled in the semantics . I know you know the perfect move at Chess.

8 / 18

slide-9
SLIDE 9

Conclusion Topics not covered Perspectives

Limited belief

9 / 18

slide-10
SLIDE 10

Conclusion Topics not covered Perspectives

Limited belief

Solution Model the knowledge computation via proof systems! [Levesque, 1984], [Lakemeyer, 1994], [Kaplan and Schubert, 2000] Knowledge base (explicit beliefs)

Deduced facts (implicit beliefs)

ˆ Kap KaKbq Kaq KaKb(p ∧ q) Kar [Liu et al., 2004], [Schwering, 2017], [Chen, Saffidine, Schwering, 2018]

10 / 18

slide-11
SLIDE 11

Conclusion Topics not covered Perspectives

Limited belief

Solution Model the knowledge computation via proof systems! [Levesque, 1984], [Lakemeyer, 1994], [Kaplan and Schubert, 2000] Knowledge base (explicit beliefs)

Deduced facts (implicit beliefs)

novice [Liu et al., 2004], [Schwering, 2017], [Chen, Saffidine, Schwering, 2018]

11 / 18

slide-12
SLIDE 12

Conclusion Topics not covered Perspectives

Limited belief

Solution Model the knowledge computation via proof systems! [Levesque, 1984], [Lakemeyer, 1994], [Kaplan and Schubert, 2000] Knowledge base (explicit beliefs)

Deduced facts (implicit beliefs)

ˆ Kap beginner [Liu et al., 2004], [Schwering, 2017], [Chen, Saffidine, Schwering, 2018]

12 / 18

slide-13
SLIDE 13

Conclusion Topics not covered Perspectives

Limited belief

Solution Model the knowledge computation via proof systems! [Levesque, 1984], [Lakemeyer, 1994], [Kaplan and Schubert, 2000] Knowledge base (explicit beliefs)

Deduced facts (implicit beliefs)

ˆ Kap KaKbq Kaq intermediate [Liu et al., 2004], [Schwering, 2017], [Chen, Saffidine, Schwering, 2018]

13 / 18

slide-14
SLIDE 14

Conclusion Topics not covered Perspectives

Limited belief

Solution Model the knowledge computation via proof systems! [Levesque, 1984], [Lakemeyer, 1994], [Kaplan and Schubert, 2000] Knowledge base (explicit beliefs)

Deduced facts (implicit beliefs)

ˆ Kap KaKbq Kaq KaKb(p ∧ q) expert [Liu et al., 2004], [Schwering, 2017], [Chen, Saffidine, Schwering, 2018]

14 / 18

slide-15
SLIDE 15

Conclusion Topics not covered Perspectives

Limited belief

Solution Model the knowledge computation via proof systems! [Levesque, 1984], [Lakemeyer, 1994], [Kaplan and Schubert, 2000] Knowledge base (explicit beliefs)

Deduced facts (implicit beliefs)

ˆ Kap KaKbq Kaq KaKb(p ∧ q) Kar

  • mniscient

[Liu et al., 2004], [Schwering, 2017], [Chen, Saffidine, Schwering, 2018]

15 / 18

slide-16
SLIDE 16

Conclusion Topics not covered Perspectives

Limited belief

Theorem With one agent, theorem proving is: NP-complete, but PSPACE-complete when the belief level is part of the input [Chen, Saffidine, Schwering, 2018] Question Extension to the multi-agent case? Extension to DEL actions? Provide approximate solutions?

16 / 18

slide-17
SLIDE 17

Conclusion Topics not covered Perspectives

Hintikka’s World

Implement many different models belief revision, plausibility models probabilistic models interpreted systems explicit VS implicit beliefs verification/synthesize of knowledge-based programs A tool for advertising AI techniques Planning SAT Sampling (cf. Kuldeep’s talk)

17 / 18

slide-18
SLIDE 18

Conclusion Topics not covered Perspectives

Trugarez bras. Merci. Thank you. Feel free to use it! http://hintikkasworld.irisa.fr/

18 / 18