Voir, savoir, faire : une étude de cas en logique modale

Voir, savoir, faire : une étude de cas en logique modale

 Comparisons between our approach and the literature 

Classical epistemic logic VS Lineland/Flatland

 In the classical epistemic modal logic S5n, wRav stands for w and v are indistinguishable for the agent a. The epistemic logic S5n has been combined with temporal modal operator [HV88]. In such temporal epistemic modal logic, the properties of total recall (no forgetting) and no learning are modeled as a constraint of the epistemic relation and the temporal relation. Kripke worlds are abstract: they are valuations. On the contrary, in our approach, we would like to describe a situation directly by the graphical and natural representation of the system (position and direction of agents) and not with a Kripke structure. In fact, we also have one canonical Kripke structure made up of those graphical Kripke worlds that embed some geometrical informations: the position of agents and the direction where they look. (see Denition 14 and Denition 27) In the same way, the epistemic relation of an agent a is built-in and relies on geometry concepts: as depicted in Figure 3.5 two Kripke worlds are indistinguishable for agent a i agent a sees the same thing in both worlds. Other built-in logics in the literature There are other logics in the literature where the semantics is built-in, that is to say where Kripke’s worlds are not abstract valuations and where the epistemic relations take into account the structure of those Kripke’s worlds. In [FHMV95] (Chapter 3), the author consider global states (you can think of them as possible worlds). A state is a tuple (se, s1, . . . , sn) where se is the state of the environment and si is the state of agent i for all agent i. Global states s = (se, s1, . . . , sn) and s 0 = (s 0 e , s0 1 , . . . , s0 n ) are then said to be indistinguishable to agent i if agent i has the same state in both s and s 0 , i.e., if si = s 0 i . In other worlds, the epistemic relation is not arbitrary but directly built-in from the denition of states. In [Jag09], the author develops a logic for rule-based agents. It is not the epistemic relation which is built-in but the belief change. A state s denes the belief of the agent: agent believes ϕ i ϕ ∈ V (s). Then the relation of belief change works as follows: T is a transition relation on states and sT u means the agent in state s can gain some belief and be in state t. This relation T is built-in with respect to a set of rules. In particular the relation T must satisfy the following statement: if a rule λ1 . . . λn → λ matches with the belief of the agent in state s then there must exist a state u such that sT u and V (u) = V (s) ∪ {λ}. 3.4.2 Spatial logic VS Lineland/Flatland 63 a b c obstacle a b c obstacle d d Figure 3.5: Two Kripke worlds that are undistisguishagle for agent a In the same manner, in our approach, we provide a logic in which wRau, that is to say, world u is possible for agent a in u, i agent a sees the same thing both in w and u.

Spatial logic VS Lineland/Flatland

 In the same way, in the next two chapters, we develop epistemic modal logic based on geometry. Our approach will be rather dierent concerning the syntax. In S4, RCC − 8, we have spatial operators like  = in the neighborhood, EC = are externally connected, etc. whereas in the next two chapters the syntax relies on the standard epistemic modal logic and will provide the classical knowledge operator Kaϕ meaning agent a knows that ϕ. This is motivated because we want to focus on epistemic reasoning. Concerning the semantics, our approach is quite similar to the logic seen in this chapter. Indeed, in Chapter 4 and 5, we have also decided to encode the geometrical structure in the model. Nevertheless, our approach is also dierent. In logics seen in this chapter, the domains in the semantics are geometrical entities: • in S4 points x of a topo-model are points of the topological space; • in the geometry seen in Subsection 3.2.1.2, the domain is the union of points and lines of the geometrical space; • in RCC − 8, the domain is the set of regions of the space, etc. Our approach rely on a Kripke model where a possible world is dened as the values of positions for all agents of the system. The epistemic relation will be dened directly from the possible worlds in term of what agents see. 3.4.3 Topological epistemic logic VS Lineland/Flatland In the topological epistemic logic presented in [MP92], [PMS07] and [Hei06], the authors provide an epistemic modal logic based on the accuracy of the observation. Concerning the semantics, models are topo-models M = (E, τ, V ). The language made up of two operators  (and its dual ♦) and K interpreted as follows, for all x ∈ E, U ∈ τ such that x ∈ U: • M,(x, U) |= ϕ i M,(x, V ) |= ϕ for all V ∈ τ such that x ∈ V ⊆ U; • M,(x, U) |= ♦ϕ i there exists V ∈ τ such that x ∈ V ⊆ U and M,(x, V ) |= ϕ; • M,(x, U) |= Kϕ i M,(y, U) |= ϕ for all y ∈ U. In (x, U), x ∈ E represents the real world but the accuracy/precision of the observation is such that the agent only knows that the real world is in U ∈ τ . The reading of the modal operators are: • M,(x, U) |= ♦ϕ: it is possible to have a better precision of the observation, that is to say, to have V ⊆ U instead of U such that ϕ is true. In other worlds, the agent can make an eort to improve her precision such that ϕ is true. • M,(x, U) |= Kϕ: the agent knows that ϕ is true, that is to say, according to the current precision of the observation represented by U, ϕ is true in all possible worlds y ∈ U. There are crucial dierences between their approach and ours: • For them, the geometry is used to represent the state of knowledge. For us, the geometry is devoted to give a position and a direction to agents. In this sense, their logic is abstract like S5n. • In their logic, there is only one agent. Chapter 4 is devoted to the case where agents are points and are located on the line. In Chapter 5, agents are located on the plan

Table des matières

Acknowledgements/Remerciements
1 Résumé de la thèse en français
1.1 Introduction
1.2 Vers une nouvelle logique modale de l’espace
1.3 Connaissance dans Lineland
1.4 Connaissance dans Flatland
1.5 Vers la logique STIT
1.6 Problème de satisabilité et axiomatisation de fragments de STIT
1.7 Un fragment STIT faible
1.8 Logique modale pour des jeux épistémiques
1.9 Emotions contre-factuelles
1.10 Conclusion
2 Introduction
2.1 Our aim: reasoning about knowledge
2.1.1 Two examples
2.1.1.1 Muddy children
2.1.1.2 Prisoner’s dilemma
2.1.1.3 Towards automated reasoning
2.1.2 Possible applications
2.1.2.1 Toy for kids
2.1.2.2 Video Games
2.1.2.3 Modeling the world
2.2 Epistemic modal logic
2.2.1 Syntax
2.2.2 Semantics
2.2.3 Two decision problems
2.2.3.1 Model-checking
2.2.3.2 Satisability problem
2.3 Complexity classes
2.3.1 Algorithms
2.3.2 Complexity with time
2.3.3 Complexity with space
2.3.4 Hardness .
2.4 Two standard problems
2.5 Reasoning in S5n
2.6 The product logic
2.6.1 Syntax of S5
2.6.2 Semantics of S5
2.6.3 Axiomatics for S5
2.6.4 Satisability problem for a S5
-formula is undecidable
2.7 Contribution of this thesis
I Seeing, knowing
3 Towards new spatial modal logics
3.1 Temporal logics
3.1.1 Linear temporal logic
3.1.2 Adding branching
3.1.3 Conclusio
3.2 Spatial reasoning
3.2.1 Euclidean geometry
3.2.1.1 Real number theory
3.2.1.2 Modal logic for euclidean spaces
3.2.2 Topology
3.2.2.1 The mathematical notion of topology
3.2.2.2 Modal logic S4
3.2.2.3 Qualitative relations: RCC − 8
3.3 Towards an epistemic spatial modal logic
3.3.1 Applications for spatial and epistemic reasoning
3.3.2 In English: time is modal; spatial is not
3.3.3 Expressivity of temporal logic VS spatial logic
3.4 Comparisons between our approach and the literature
3.4.1 Classical epistemic logic VS Lineland/Flatland
3.4.2 Spatial logic VS Lineland/Flatland
3.4.3 Topological epistemic logic VS Lineland/Flatland
4 Knowledge in Lineland
4.1 Introduction
4.2 Lineland
4.2.1 Syntax
4.2.2 Semantics
4.2.3 Technical results
4.2.4 Some valid formulas
4.3 Model checking and satisability
4.3.1 Perception fragment
4.3.2 Perception and knowledge
4.4 Axiomatization
4.4.1 Perception fragment
4.4.2 Perception and knowledge
4.5 Conclusion and perspectives
4.6 Implementation
4.6.1 Pedagogical motivation
4.6.2 How deos it work ?
4.6.3 Technical information
4.6.3.1 The engine in Scheme
4.6.3.2 The front end in Java
5 Knowledge in Flatland
5.1 Introduction
5.2 Syntax
5.3 Notations
5.4 Concrete semantics
5.5 Two decision problems
5.5.1 A non-successful qualitative semantics
5.5.2 Translation into real numbers
5.6 Public announcement
5.6.1 Denitions
5.6.2 Decidability
5.7 Weaker semantics
5.8 Comparisons
5.9 Perspectives
5.10 Open questions
II Doing
6 Towards the logic STIT
6.1 PDL
6.2 Coalition Logic
6.3 Drawbacks of Coalition Logic
6.3.1 Combining with epistemic logic: de dicto VS de re
6.3.2 Counterfactual emotions
6.3.3 Solutions
6.4 The STIT logic
6.4.1 Syntax
6.4.2 Traditional semantics with Branching time structure
6.4.2.1 STIT-branching time structure
6.4.2.2 Adding choices
6.5 A semantics with Kripke structures
6.5.1 Denition
6.5.2 Equivalence
6.6 Conclusion
7 Satisability problem and axiomatization of fragments of STIT
7.1 Forget time for a while
7.1.1 Group STIT
7.1.1.1 Group STIT is undecidable
7.1.1.2 Group STIT is non-axiomatizable
7.1.2 Individual STIT plus the grand coalition without time
7.1.2.1 Denition
7.1.2.2 Semantics
7.1.2.3 Complexity
7.1.2.4 Axiomatization
7.1.3 A generalization of individual coalitions
7.1.3.1 Complexity
7.1.3.2 Axiomatization
7.1.4 The logic of chains of coalitions
7.1.4.1 The case when AGT is xed
7.1.4.2 The case when AGT is variable
7.2 With the neXt operator
7.2.1 Individual STIT plus the grand coalition plus neXt operator
7.2.2 When there is only one agent
7.3 Conclusion and perspectives
8 A weak STIT fragment
8.1 Syntax
8.2 Models
8.3 The NCL logic
8.3.1 Denition
8.3.2 Axiomatization of NCL
8.3.3 Link between STIT and NCL
8.4 Decidability and axiomatization
8.5 Open questions
III Knowing, Doing
9 Modal logic of epistemic games
9.1 Introduction
9.2 A logic of joint actions, knowledge and preferences
9.2.1 Syntax
9.2.2 Semantics
9.2.3 Axiomatization
9.3 A logical account of epistemic games
9.3.1 Best response and Nash equilibrium
9.3.2 Epistemic rationality
9.3.3 Iterated deletion of strictly dominated strategies
9.4 Game transformation
9.5 Imperfect information
9.6 Weaker forms of perfect information
9.7 Related works
9.8 Conclusion
10 Counterfactual emotions
10.1 Counterfactual statements in STIT
10.1.1 J could have prevented χ
10.1.2 Discussion
10.2 A STIT extension with knowledge
10.2.1 knowledge
10.2.2 Denition
10.2.3 Decidability
10.2.4 Axiomatization
10.3 A formalization of counterfactual emotions
10.3.1 Regret and rejoicing
10.3.2 Disappointment and elation
10.3.3 Discussion
10.4 Related works
10.5 Conclusion
Conclusion and perspectives

projet fin d'etudeTélécharger le document complet

Télécharger aussi :

Laisser un commentaire

Votre adresse e-mail ne sera pas publiée. Les champs obligatoires sont indiqués avec *