Perception in Update Logic
|
|
- Baldwin Hamilton
- 6 years ago
- Views:
Transcription
1 Perception in Update Logic Jan van Eijck CWI, Amsterdam, Uil-OTS, Utrecht, NIAS, Wassenaar June 25, 2007 I see nobody on the road, said Alice. I only wish I had such eyes, the King remarked in a fretful tone. To be able to see Nobody! And at that distance too! Abstract Three key ways of updating one s knowledge are Lewis Carroll, Alice in Wonderland. 1. perception of states of affairs, e.g., seeing with one s own eyes that reception of messages, e.g., being told that drawing new conclusions from known facts. If one represents knowledge by means of Kripke models, the implicit assumption is that drawing conclusions is immediate. This assumption of logical omniscience is a useful abstraction. It leaves the distinction between (1) and (2) to be accounted for. In current versions of Update Logic (Dynamic Epistemic Logic, Logic of Communication and Change) perception and message reception are not distinguished. I will look at what is needed to distinguish them. 1 The Riddle of the Caps Imagine four people standing in line, with three of them looking to the left, and one looking to the right. These fellows, let us call them a, b, c, d, each wear a cap. The leftmost guy, a, can see no-one; b can see a; c can see a and b, and d, who has his head turned in the other direction, can see no-one. 1
2 Assume it is common knowledge what the perceptive capabilities of the agents are. So it is common knowledge that a can see no-one, that b can see a but no others, that c can see a and b but no others, and that d, can see no-one. In particular it is commonly known that they all wear a cap, and that no-one can see the colour of his own cap. Now let there be a public announcement there are two white caps and two black caps. After this, c knows the colour his cap, for he can reason: I see two white caps in front of me. There are only two white caps. So my own cap must be black. If c publicly announces I know the colour of my ca, then as a result b gets to know the colour of this cap as well. For b can reason as follows. If the guy behind me knows the colour of his cap, then this means that he sees two caps of the same colour in front of him. I see that a has a white cap, so my own cap must be white as well. Now suppose the initial situation is like this: the participants all face in the same directions as before, but now b and d have swapped caps. In this case, obviously, c does not know the colour of his cap. But if c publicly announces I do not know the colour of my cap, then this announcement reveals to b that the colour of his cap must be black. The ingredients that are used here are public announcements ( There are two white caps and two black caps, I know/do not know the colour of my cap ) and common knowledge about the perceptive capabilities of the participants. 2 Common Knowledge, Public Announcement and Perception Common knowledge is a term coined by David Lewis in [Lewis, 1969]. It is sometimes called mutual knowledge ([Schiffer, 1972; Clark and Marshall, 1978; 1981]), and it is essentially different from general knowledge. If a group of people say the group of NIAS fellows get separate messages that there will be dinner party on Thursday, this generates general knowledge: we all know that there is a dinner, but I do not know that you know there is a 2
3 dinner, you do not know that I know that there is a dinner,... If, instead, we all get the same about the dinner, and we see that we are all on the addressee list, this generates common knowledge. Given individual accessibilities R i for a i I, where I is a group of agents, then I-common knowledge has accessibility relation ( ) R i. i I The semantics of common knowledge is expressed in terms of a fixpoint operation, so it seems natural to assume that common knowledge is something that emerges in the limit of a series of steps of knowledge aggregation, that it is some idealized version of what happens when we acquire knowledge about knowledge in real life. Nothing could be further from the truth. Common knowledge is ubiquitous, and it comes about in a single step, in one of the following ways: by public announcement [Plaza, 1989]. by common witnessing of an event, when it is already common knowledge that all can perceive the event [Clark and Marshall, 1978] by variations and combinations of the above ( indirect co-presence, cultural co-presence [Clark and Marshall, 1978]). Since common knowledge emerges in no other ways than these, it would seem that creating common knowledge about perceptive abilities prepares the ground for creating common knowledge about perceived events. The philosophical literature on perception in particular the problems caused by perceptual illusion or hallucination is vast. See [Austin, 1962; Davidson, 1982; Dretske, 1969; 1981; Rock, 1985] for a small sample. Rather than take all of this on board, I will draw some methodological limitations from the outset, in that I will assume that perceptions are limited (not all that is known is perceived) but accurate (no illusion; all that is perceived is known). The first of these is uncontroversial. It merely states that there is more to knowledge than perception. The second allows us to get rid of puzzles about hallucination. These limitations can easily be lifted, but in this paper I see no need to do so. 3
4 Analyzing the example puzzle with this in mind, can we see what common knowledge about perceptive abilities is needed? In the example case, the following should somehow become common knowledge: that the leftmost person can see no-one, that the second person can see the first, that the third can see the first and the second, and that the rightmost guy sees no-one. To tackle this, I will use a logic of public announcement and common knowledge with the following syntax (let i range over a set of agents I, and p over a set of propositions P ): φ ::= p φ φ 1 φ 2 [α]φ [φ i ]φ 2 α ::= i?φ α 1 α 2 α 1 ; α 2 α, Assume the usual abbreviations. In particular, φ 1 φ 2 is shorthand for ( φ 1 φ 2 ), φ 1 φ 2 for (φ 1 φ 2 ), α φ for [α] φ. Finally, [i]φ is abbreviated as K i φ, and [( i I i) ]φ as Cφ. This language is interpreted in the usual multimodal Kripke models (or labeled transition systems). Such a model M is a triple (W, V, R) where W is a nonempty set of worlds, V : W P(P ) assigns a valuation to each world w W, and R : I P(W 2 ) assigns an accessibility relation i to each agent i I. If M = (W, V, R) be given, we refer to its components as W M, V M and R M. Let M be given, and let w W M. Then the truth definition is given by: M = w always M = w p : p V M (w) M = w φ : not M = w φ M = w φ 1 φ 2 : M = w φ 1 and M = w φ 2 M = w [α]φ : for all w with w α w M = w φ M = w [!φ 1 ]φ 2 : if M = w φ 1 then M φ 1 = w φ 2, with M φ 1 given by W M φ1 = {w W M M = w φ 1 }, and V M φ1 and R M φ1 the restrictions of V M and R M to W M φ1 4
5 w i w : wr M (i)w w?φ w : w = w and M = w φ w α 1;α 2 w w α 1 α 2 w : w with w α 1 w and w α 2 w : w α 1 w or w α 2 w w α w : w 1,..., w n with w = w 1, w α = w n, w i wi+1 for 1 i < n. Use [φ] M for {w W M M = w φ}. This is the public announcement restriction of the format of Logics of Communication and Change or LCC [Benthem et al., 2006b], which is in turn a version of BMS style update logic [Baltag et al., 1999]. Using b i for the cap of the i-th guy (counting from left to right) is black and D i (p) for K i p K i p, we get that update with!d i (p) expresses the public announcement: i can (perceptually) distinguish p from p. Here are the public announcements that make the relevant perceptive abilities common knowledge: The first guy cannot see the colour of any hat. D 1 (b 1 ) D 1 (b 2 ) D 1 (b 3 ) D 1 (b 4 ) The second guy can see the colour of hat 1, but not the colours of hats 2,3,4. D 2 (b 1 ) D 2 (b 2 ) D 2 (b 3 ) D 2 (b 4 ) The third guy can see the colours of hats 1,2, but not the colours of hats 3,4. D 3 (b 1 ) D 3 (b 2 ) D 3 (b 3 ) D 3 (b 4 ) The fourth guy cannot see the colour of any hat. D 4 (b 1 ) D 4 (b 2 ) D 4 (b 3 ) D 4 (b 4 ) In the semantics above, we have given a semantics of knowledge, not perception. One possible way to go in order to incorporate perception would be to extend each R i knowledge relation to an S i perception relation, add an operation for individual perception, say î, stipulate that î is interpreted by S i, and impose suitable conditions on the relations, in particular R i S i. An example would look like this (black for knowledge, red for perception): 5
6 0:bb 1:bw 2:wb 3:ww Unfortunately, there are problems with this approach. In the first place, this does not quite fit the update logic framework, for it obscures the fact that epistemic update logic is already a logic of observations [Benthem, 2005]. The main problem, however, is that this is an attempt to accommodate perception as part of the statics of what goes on. Given that perception is always perception of phenomena in a fleeting world, this is not a natural way to go. What is eternal and unchanging cannot be perceived. To be perceivable is always the hallmark of being part of the world of phenomena, the world described by esse est percipi. Perception is simply change in the world that gets noticed. Given this, the distinction between knowledge and perception reveals itself when the world itself changes. If the changes in the world go unnoticed, knowledge may be lost. If the changes in the world get noticed, we can say that change is perceived, and as a consequence knowledge gets updated. To flesh this out, what is needed is an account of perceptive abilities: Which changes can be observed by which agents? Which agents are aware of the perceptive abilities of others? Which perceptive abilities are common knowledge? 6
7 Systematic frameworks for answering these questions bring in the aspect of perspective in a natural way. There is an important distinction between individual awareness and common knowledge. Consider the example again. Imagine that the four guys with the hats are standing in line again, or rather, that someone has put them in line with their eyes closed. Now the first guy opens his eyes, and realizes: I am in a position where I see nobody. Next, the second guy opens his eyes, and realizes: I am in a position where I can see 1 in front of me. Then, the third guy opens his eyes, and realizes: I am in a position where I can see 1 and 2 in front of me. Finally, the fourth guy opens his eyes, and realizes: I am in a position where I see nobody. The important point now is that unless they all publicly announce their perception capabilities the reasoning about knowledge and ignorance scenario of the example never gets off the ground. 3 Change in the World Suppose the world changes from to That is: the second and third guy swap caps. To model this in our logic, we add substitutions. Substitutions as a mechanism for modelling actual change were first explored in [Eijck, 2004], and subsequently adopted in [Benthem et al., 2006b], and later in [Kooi, 2007]. Let a language L P be given, where P is the set of basic (factual) propositions of the language. Then an L P -substitution is a function of type L P L P that distributes over all language constructs, and that maps all but a finite number of basic propositions to themselves. L P substitutions can be represented as sets of bindings {p 1 φ 1,..., p n φ n } 7
8 where all the p i are different. If σ is an L P substitution, then the set {p P σ(p) p} is called its domain, notation dom(σ). It is customary to omit from a substitution all bindings p φ with p = φ (p not in the domain). Use ɛ for the identity substitution. Let Sub LP be the set of all L P substitutions. If M = (W, V, R) is an epistemic model and σ is an L P substitution, then VM σ is the valuation given by λp [σ(p)] M. In other words, VM σ assigns to w the set of worlds w in which σ(p) is true. For M = (W, V, R), call M σ the model given by (W, VM σ, R). Then we can extend the language with a construct [σ]φ, with the following semantic clause: M = w [σ]φ : M σ = w φ. Since applying a substitution is a functional operation we immediately get: M = w [σ]φ iff M = w [σ] φ. Using the obvious abbreviation, this says that [σ]φ is equivalent to σ φ. Now we can handle perception and change as follows. Suppose it is common knowledge that all agents can perceptively discriminate between b and b. This means that the following formula holds: C i I D i b. Suppose we change the world by swapping the truth value of b. This means we apply the following substitution: {b p}. Then if b was true before the substitution, then after it it is common knowledge that b, for the following principle holds: b C i I D i b [{b p}]c b. This illustrates the creation of common knowledge without public announcement. Another kind of change is the world is a perspective shift. Suppose the world changes from 8
9 to Again, assume that the perceptive abilities in the caps example are common kwowledge. Suppose the third guy then turns around. He is now looking to the right. Notice that nobody can see this! But the effect is dramatic. Subsequent factual changes may map S5 models to non-s5 models, for if the first guy gets a different colour cap, then the second guy will still believe that the third guy sees this, and draw the wrong conclusions. It follows that to prevent knowledge degeneration, in a system of knowledge and perception, loss of perceptive ability due to perceptive shifts must be made common knowledge. 4 Models for Epistemic/Perceptive PDL M = (W, {R i i I}, V, F ), where W is a set of worlds, the R i are binary (equivalence) relations on W, V is a valuation on W, F : P (P(I), P(I)) is an awareness function. If F (p) = (J, K), then J are the agents that are privately attuned to p, K are the agents that are publicly attuned to p, assume J K =. 9
10 5 A Language for Public Announcement, Perception, and Change Epistemic/Perceptive PDL with public announcement, factual change, and three kinds of perceptive changes: Abbreviations: K i φ for [i]φ, φ ::= p φ φ 1 φ 2 [π]φ [!φ 1 ]φ 2 [p := φ 1 ]φ 2 [Pr i p]φ [Pu i p]φ [Er i p]φ π ::= i φ? π 1 ; π 2 π 1 π 2 π C i,...,k φ for [(i k) ]φ (common knowledge) 6 Action Model for Public Announcement Everyone is aware of the announcement of p: p I Updating with this action model has the effect of removing all the worlds where p is false, while leaving the accessibility relations the same. 7 Action Model for Private Perception of State of p Assume a private observer i and suppose j, k are outsiders. 10
11 p -p jk jk p jk p jk -p -p 8 Action Model for Public Perception of State of p Assume a public observer i and suppose j, k are outsiders. p jk -p 11
12 9 Action Model for Perception of State of p Assume a private observer i and a public observer j, and suppose k is an outsider. p -p jk k p k p jk ik ik -p -p 10 Action Model for Perception of Change of State of p Assume a private observer i and a public observer j, and suppose k is an outsider. 12
13 p := phi jk p := phi k ik T [ ] M = [p] M = {w W M p V M (w)} [ φ] M = W M [φ] M [φ 1 φ 2 ] M = [φ 1 ] M [φ 2 ] M [[π]φ] M = {w W M v( if (w, v) [π ] M then v [φ] M )} [[!φ 1 ]φ 2 ] M = [φ 2 ] M φ 1 [[p := φ 1 ]φ 2 ] M = {w W M if w [pre(e)] M then (w, e) [φ] M A } with (A, e) the appropriate action model [[Pr i p]φ] M = {w W M e E s.t. [[Pu i p]φ] M = similar... [[Er i p]φ] M = [φ] M if w [pre(e)] M then (w, e) [φ] M A } with (A, E) the appropriate action model and M the result of adjusting the awareness function with M the result of adjusting the awareness function 13
14 11 Denotation of π [i] M = R i [?φ] M = {(w, w) W M W M w [φ] M } [π 1 ; π 2 ] M = [π 1 ] M [π 2 ] M [π 1 π 2 ] M = [π 1 ] M [π 2 ] M [π ] M = ([π ] M ) 12 Expressive Power Epistemic/Perceptive PDL with change and public announcement has the same expressive power as Epistemic PDL. Reduction in two stages: translate into LCC. Example clause: T F [Pr i p]φ = [(A, E)]T F φ, where (A, E) is the appropriate action model, and F is the adjusted awareness function. reduce LCC to PDL (use approach of [Benthem et al., 2006b]). Example clause: ([(A, E)][π]φ) = [π ]([(A, E)]φ), where π is the appropriately transformed PDL program π. Reduction axioms + PDL axioms give a complete axiomatisation. 13 Further Work: Modelling Limitations of Perception How does one express limitations of perceptive ability? Need to get around paradox of the heap (approach of [Shoham and del Val, 1991] not fully adequate). Distinction between actual perception and capability of perception (logic of sensors of [del Val et al., 1997]) Logic of perceptibilia [Bell, 2000]... If one represents uncertainty in perception with probabilities: link with [Benthem et al., 2006a]. 14
15 14 Conclusions Present framework demonstrates how common perception of change creates common knowledge. Common knowledge about limitations to perception can also create common knowledge. If we can all see that a person is blind, then her resulting lack of perception of change will become common knowledge. Awareness of basic propositions allows for the modelling of communication channels in DEL: if i is aware that j can perceive changes in p, then p is a communication channel between i and j. References [Austin, 1962] J.L. Austin. Sense and Sensibilia. Oxford University Press, [Baltag et al., 1999] A. Baltag, L.S. Moss, and S. Solecki. The logic of public announcements, common knowledge, and private suspicions. Technical Report SEN-R9922, CWI, Amsterdam, [Bell, 2000] J.L. Bell. Continuity and the logic of perception. Transcendent Philosophy, 1(2):1 7, [Benthem et al., 2006a] J. van Benthem, J. Gerbrandy, and B. Kooi. Dynamic update with probabilities, [Benthem et al., 2006b] J. van Benthem, J. van Eijck, and B. Kooi. Logics of communication and change. Information and Computation, 204(11): , [Benthem, 2005] Johan van Benthem. Open problems in logic and games. Technical Report PP , ILLC, Amsterdam, [Clark and Marshall, 1978] H.H. Clark and C.R. Marshall. diaries. Technical report, Stanford University, Reference [Clark and Marshall, 1981] H.H. Clark and C.R. Marshall. Definite reference and mutual knowledge. In A.K. Joshi, B. Webber, and I. Sag, editors, Elements of discourse understanding, pages Cambridge University Press,
16 [Davidson, 1982] D. Davidson. Mental events. In Essays on Actions and Events. Oxford University Press, [del Val et al., 1997] Alvaro del Val, Pedrito Maynard-Reid II, and Yoav Shoham. Qualitative reasoning about perception and belief. In IJCAI (1), pages , [Dretske, 1969] Fred Dretske. Seeing and Knowing. University of Chicago Press, [Dretske, 1981] Fred Dretske. Knowledge and The Flow of Information. Bradford/MIT Press, Cambridge, MA, [Eijck, 2004] Jan van Eijck. Guarded actions. Technical Report SEN-E0425, CWI, Amsterdam, December Available from rapporten/. [Kooi, 2007] B.P. Kooi. Expressivity and completeness for public update logics via reduction axioms. Journal of Applied Non-Classical Logics, 16(2), [Lewis, 1969] D.K. Lewis. Convention: A Philosophical Study. Harvard University Press, [Plaza, 1989] J. A. Plaza. Logics of public communications. In M. L. Emrich, M. S. Pfeifer, M. Hadzikadic, and Z. W. Ras, editors, Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems, pages , [Rock, 1985] Irvin Rock. The Logic of Perception. MIT Press, [Schiffer, 1972] S.R. Schiffer. Meaning. Oxford University Press, [Shoham and del Val, 1991] Yoav Shoham and Alvaro del Val. A logic for perception and belief. Technical Report CS-TR , Stanford University,
Common Knowledge in Update Logics
Common Knowledge in Update Logics Johan van Benthem, Jan van Eijck and Barteld Kooi Abstract Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added for groups
More informationWhat is DEL good for? Alexandru Baltag. Oxford University
Copenhagen 2010 ESSLLI 1 What is DEL good for? Alexandru Baltag Oxford University Copenhagen 2010 ESSLLI 2 DEL is a Method, Not a Logic! I take Dynamic Epistemic Logic () to refer to a general type of
More informationTR : Public and Private Communication Are Different: Results on Relative Expressivity
City University of New York CUNY) CUNY Academic Works Computer Science Technical Reports The Graduate Center 2008 TR-2008001: Public and Private Communication Are Different: Results on Relative Expressivity
More informationTowards Symbolic Factual Change in Dynamic Epistemic Logic
Towards Symbolic Factual Change in Dynamic Epistemic Logic Malvin Gattinger ILLC, Amsterdam July 18th 2017 ESSLLI Student Session Toulouse Are there more red or more blue points? Are there more red or
More informationEpistemic Informativeness
Epistemic Informativeness Yanjing Wang, Jie Fan Department of Philosophy, Peking University 2nd AWPL, Apr. 12th, 2014 Motivation Epistemic Informativeness Conclusions and future work Frege s puzzle on
More informationProduct Update and Looking Backward
Product Update and Looking Backward Audrey Yap May 21, 2006 Abstract The motivation behind this paper is to look at temporal information in models of BMS product update. That is, it may be useful to look
More informationLogic and Artificial Intelligence Lecture 6
Logic and Artificial Intelligence Lecture 6 Eric Pacuit Currently Visiting the Center for Formal Epistemology, CMU Center for Logic and Philosophy of Science Tilburg University ai.stanford.edu/ epacuit
More informationEpistemic Informativeness
Epistemic Informativeness Yanjing Wang and Jie Fan Abstract In this paper, we introduce and formalize the concept of epistemic informativeness (EI) of statements: the set of new propositions that an agent
More informationSOME SEMANTICS FOR A LOGICAL LANGUAGE FOR THE GAME OF DOMINOES
SOME SEMANTICS FOR A LOGICAL LANGUAGE FOR THE GAME OF DOMINOES Fernando R. Velázquez-Quesada Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas Universidad Nacional Autónoma de México
More informationSchematic Validity in Dynamic Epistemic Logic: Decidability
This paper has been superseded by W. H. Holliday, T. Hoshi, and T. F. Icard, III, Information dynamics and uniform substitution, Synthese, Vol. 190, 2013, 31-55. Schematic Validity in Dynamic Epistemic
More informationPreference and its Dynamics
Department of Philosophy,Tsinghua University 28 August, 2012, EASLLC Table of contents 1 Introduction 2 Betterness model and dynamics 3 Priorities and dynamics 4 Relating betterness and priority dynamics
More informationGeneral Dynamic Dynamic Logic
General Dynamic Dynamic Logic Patrick Girard Department of Philosophy University of Auckland Jeremy Seligman Department of Philosophy University of Auckland Fenrong Liu Department of Philosophy Tsinghua
More informationAgency and Interaction in Formal Epistemology
Agency and Interaction in Formal Epistemology Vincent F. Hendricks Department of Philosophy / MEF University of Copenhagen Denmark Department of Philosophy Columbia University New York / USA CPH / August
More informationChanging Types. Dominik Klein Eric Pacuit. April 24, 2011
Changing Types Dominik Klein Eric Pacuit April 24, 2011 The central thesis of the epistemic program in game theory (Brandenburger, 2007) is that the basic mathematical models of a game situation should
More informationThe Muddy Children:A logic for public announcement
The Muddy Children: Jesse Technical University of Eindhoven February 10, 2007 The Muddy Children: Outline 1 2 3 4 The Muddy Children: Quincy Prescott Baba: At least one of you is muddy. Quincy: I don t
More informationRough Sets for Uncertainty Reasoning
Rough Sets for Uncertainty Reasoning S.K.M. Wong 1 and C.J. Butz 2 1 Department of Computer Science, University of Regina, Regina, Canada, S4S 0A2, wong@cs.uregina.ca 2 School of Information Technology
More informationConditional Probability and Update Logic
Conditional Probability and Update Logic 1 Second version, January 2003 Johan van Benthem, Amsterdam & Stanford Abstract ynamic update of information states is the dernier cri in logical semantics. And
More informationModal Logics. Most applications of modal logic require a refined version of basic modal logic.
Modal Logics Most applications of modal logic require a refined version of basic modal logic. Definition. A set L of formulas of basic modal logic is called a (normal) modal logic if the following closure
More informationLogic and Artificial Intelligence Lecture 12
Logic and Artificial Intelligence Lecture 12 Eric Pacuit Currently Visiting the Center for Formal Epistemology, CMU Center for Logic and Philosophy of Science Tilburg University ai.stanford.edu/ epacuit
More informationTo every formula scheme there corresponds a property of R. This relationship helps one to understand the logic being studied.
Modal Logic (2) There appeared to be a correspondence between the validity of Φ Φ and the property that the accessibility relation R is reflexive. The connection between them is that both relied on the
More informationAn Inquisitive Formalization of Interrogative Inquiry
An Inquisitive Formalization of Interrogative Inquiry Yacin Hamami 1 Introduction and motivation The notion of interrogative inquiry refers to the process of knowledge-seeking by questioning [5, 6]. As
More informationLogics For Epistemic Programs
1 / 48 Logics For Epistemic Programs by Alexandru Baltag and Lawrence S. Moss Chang Yue Dept. of Philosophy PKU Dec. 9th, 2014 / Seminar 2 / 48 Outline 1 Introduction 2 Epistemic Updates and Our Target
More informationCapturing Lewis s Elusive Knowledge
Zhaoqing Xu Department of Philosophy, Peking University zhaoqingxu@gmail.com September 22, 2011 1 Introduction 2 Philosophical Background Dretske s Relevant Alternatives Theory Lewis s Elusive Knowledge
More informationSimulation and information: quantifying over epistemic events
Simulation and information: quantifying over epistemic events Hans van Ditmarsch 12 and Tim French 3 1 Computer Science, University of Otago, New Zealand, hans@cs.otago.ac.nz 2 CNRS-IRIT, Université de
More informationReversed Squares of Opposition in PAL and DEL
Center for Logic and Analytical Philosophy, University of Leuven lorenz.demey@hiw.kuleuven.be SQUARE 2010, Corsica Goal of the talk public announcement logic (PAL), and dynamic epistemic logic (DEL) in
More informationUndecidability in Epistemic Planning
Undecidability in Epistemic Planning Thomas Bolander, DTU Compute, Tech Univ of Denmark Joint work with: Guillaume Aucher, Univ Rennes 1 Bolander: Undecidability in Epistemic Planning p. 1/17 Introduction
More information09 Modal Logic II. CS 3234: Logic and Formal Systems. October 14, Martin Henz and Aquinas Hobor
Martin Henz and Aquinas Hobor October 14, 2010 Generated on Thursday 14 th October, 2010, 11:40 1 Review of Modal Logic 2 3 4 Motivation Syntax and Semantics Valid Formulas wrt Modalities Correspondence
More informationCorrelated Information: A Logic for Multi-Partite Quantum Systems
Electronic Notes in Theoretical Computer Science 270 (2) (2011) 3 14 www.elsevier.com/locate/entcs Correlated Information: A Logic for Multi-Partite Quantum Systems Alexandru Baltag 1,2 Oxford University
More informationReasoning Under Uncertainty: Introduction to Probability
Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1 Textbook 6.1 Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 1 Lecture Overview 1
More informationKnowledge and Action in Semi-Public Environments
Knowledge and Action in Semi-Public Environments Wiebe van der Hoek, Petar Iliev, and Michael Wooldridge University of Liverpool, United Kingdom {Wiebe.Van-Der-Hoek,pvi,mjw}@liverpool.ac.uk Abstract. We
More informationArbitrary Announcements in Propositional Belief Revision
Arbitrary Announcements in Propositional Belief Revision Aaron Hunter British Columbia Institute of Technology Burnaby, Canada aaron hunter@bcitca Francois Schwarzentruber ENS Rennes Bruz, France francoisschwarzentruber@ens-rennesfr
More informationModels of Strategic Reasoning Lecture 4
Models of Strategic Reasoning Lecture 4 Eric Pacuit University of Maryland, College Park ai.stanford.edu/~epacuit August 9, 2012 Eric Pacuit: Models of Strategic Reasoning 1/55 Game Plan Lecture 4: Lecture
More informationExtending Probabilistic Dynamic Epistemic Logic
Extending Probabilistic Dynamic Epistemic Logic Joshua Sack joshua.sack@gmail.com Abstract This paper aims to extend in two directions the probabilistic dynamic epistemic logic provided in Kooi s paper
More informationLogics of communication and change
Information and Computation 204 (2006) 1620 1662 www.elsevier.com/locate/ic Logics of communication and change Johan van Benthem a,b, Jan van Eijck c,d, * Barteld Kooi e a ILLC, University of Amsterdam,
More informationThe paradox of knowability, the knower, and the believer
The paradox of knowability, the knower, and the believer Last time, when discussing the surprise exam paradox, we discussed the possibility that some claims could be true, but not knowable by certain individuals
More informationFrom conditional probability to the logic of doxastic actions
From conditional probability to the logic of doxastic actions Alexandru Baltag and Sonja Smets Abstract We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability,
More informationA Uniform Logic of Information Dynamics
A Uniform Logic of Information Dynamics Wesley H. Holliday Tomohiro Hoshi Thomas F. Icard, III Logical Dynamics Lab, Center for the Study of Language and Information Cordura Hall, 210 Panama Street, Stanford,
More informationPresuppositions (introductory comments)
1 Presuppositions (introductory comments) Some examples (1) a. The person who broke the typewriter was Sam. b. It was Sam who broke the typewriter. c. John screwed up again. d. John likes Mary, too. e.
More informationMulti-Agent Action Modeling through Action Sequences and Perspective Fluents
Multi-Agent Action Modeling through Action Sequences and Perspective Fluents Chitta Baral, Gregory Gelfond, Enrico Pontelli and Tran Cao Son Abstract Actions in a multi-agent setting have complex characteristics.
More informationIntroduction to Epistemic Reasoning in Interaction
Introduction to Epistemic Reasoning in Interaction Eric Pacuit Center for Logic and Philosophy of Science Tilburg University ai.stanford.edu/~epacuit December 9, 2009 Eric Pacuit 1 We are interested in
More informationLogics of Communication and Change
Logics of Communication and Change Johan van Benthem a Jan van Eijck b Barteld Kooi c a ILLC, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam, The Netherlands & Philosophy Department,
More informationDynamic Logics of Knowledge and Access
Dynamic Logics of Knowledge and Access Tomohiro Hoshi (thoshi@stanford.edu) Department of Philosophy Stanford University Eric Pacuit (e.j.pacuit@uvt.nl) Tilburg Center for Logic and Philosophy of Science
More informationLogics of Rational Agency Lecture 3
Logics of Rational Agency Lecture 3 Eric Pacuit Tilburg Institute for Logic and Philosophy of Science Tilburg Univeristy ai.stanford.edu/~epacuit July 29, 2009 Eric Pacuit: LORI, Lecture 3 1 Plan for the
More informationInference and update. Fernando Raymundo Velázquez-Quesada
DOI 10.1007/s11229-009-9556-2 Inference and update Fernando Raymundo Velázquez-Quesada Received: 18 November 2008 / Accepted: 7 April 2009 The Author(s) 2009. This article is published with open access
More informationOn the Logic of Lying
On the Logic of Lying Hans van Ditmarsch, Jan van Eijck, Floor Sietsma, Yanjing Wang Second Draft, June 2007 Abstract We look at lying as an act of communication, where (i) the proposition that is communicated
More informationuse these reduction axioms to reduce both the model checking problem and the satisfiability problem of DEL to the model checking problem and the satis
On the Complexity of Dynamic Epistemic Logic Guillaume Aucher University of Rennes - INRIA guillaume.aucher@irisa.fr François Schwarzentruber ENS Cachan - Brittany extension francois.schwarzentruber@bretagne.enscachan.fr
More informationLogic and Artificial Intelligence Lecture 13
Logic and Artificial Intelligence Lecture 13 Eric Pacuit Currently Visiting the Center for Formal Epistemology, CMU Center for Logic and Philosophy of Science Tilburg University ai.stanford.edu/ epacuit
More informationReasoning Under Uncertainty: Introduction to Probability
Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Lecture 23 March 12, 2007 Textbook 9 Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Lecture 23, Slide 1 Lecture Overview
More informationVerifying One Hundred Prisoners and a Lightbulb
Verifying One Hundred Prisoners and a Lightbulb Hans van Ditmarsch *, Jan van Eijck ** and William Wu *** * D. Logic, University of Sevilla, Spain Email: hvd@us.es ** CWI, Amsterdam & OTS, University of
More informationModel Transformers for Dynamical Systems of Dynamic Epistemic Logic Rendsvig, Rasmus Kræmmer
university of copenhagen Model Transformers for Dynamical Systems of Dynamic Epistemic Logic Rendsvig, Rasmus Kræmmer Published in: Logic, Rationality, and Interaction DOI: 10.1007/978-3-662-48561-3_26
More informationEpistemic Logic: VI Dynamic Epistemic Logic (cont.)
Epistemic Logic: VI Dynamic Epistemic Logic (cont.) Yanjing Wang Department of Philosophy, Peking University Oct. 26th, 2015 Two basic questions Axiomatizations via reduction A new axiomatization Recap:
More informationDynamics for Inference
Dynamics for Inference Alexei Angelides 1 Introduction Consider the following two situations: (DS) from P Q, and P, infer Q. and (WS) I order beef, Jesse orders fish, Darko orders veg. A new waiter walks
More informationYet More Modal Logics of Preference Change and Belief Revision
0001 0002 0003 0004 0005 0006 0007 0008 0009 0010 0011 Yet More Modal Logics of Preference Change and Belief Revision Jan van Eijck Centre for Mathematics and Computer Science (CWI) Kruislaan 413 1098
More informationETL, DEL, and Past Operators
ETL, DEL, and Past Operators Tomohiro Hoshi Stanford University thoshi@stanford.edu Audrey Yap University of Victoria ayap@uvic.ca Abstract [8] merges the semantic frameworks of Dynamic Epistemic Logic
More informationReasons for Rejecting a Counterfactual Analysis of Conclusive Reasons
Reasons for Rejecting a Counterfactual Analysis of Conclusive Reasons Abstract In a recent article [1], Charles Cross applies Lewisian counterfactual logic to explicate and evaluate Fred Dretske s conclusive
More informationDEL-sequents for Regression and Epistemic Planning
DEL-sequents for Regression and Epistemic Planning Guillaume Aucher To cite this version: Guillaume Aucher. DEL-sequents for Regression and Epistemic Planning. Journal of Applied Non-Classical Logics,
More informationDepartment of Computer Science, University of Otago. The logic of ontic and epistemic change
Department of Computer Science, University of Otago Technical Report OUCS-2006-11 The logic of ontic and epistemic change Authors: Hans van Ditmarsch Department of Computer Science, University of Otago
More informationMultiagent planning and epistemic logic
Multiagent planning and epistemic logic Andreas Herzig IRIT, CNRS, Univ. Toulouse, France Journée plénière, prégdr sur les Aspects Formels et Algorithmiques de l IA July 5, 2017 1 / 25 Outline 1 Planning:
More informationFor True Conditionalizers Weisberg s Paradox is a False Alarm
For True Conditionalizers Weisberg s Paradox is a False Alarm Franz Huber Department of Philosophy University of Toronto franz.huber@utoronto.ca http://huber.blogs.chass.utoronto.ca/ July 7, 2014; final
More informationFor True Conditionalizers Weisberg s Paradox is a False Alarm
For True Conditionalizers Weisberg s Paradox is a False Alarm Franz Huber Abstract: Weisberg (2009) introduces a phenomenon he terms perceptual undermining He argues that it poses a problem for Jeffrey
More informationAmbiguous Language and Differences in Beliefs
Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning Ambiguous Language and Differences in Beliefs Joseph Y. Halpern Computer Science Dept. Cornell
More informationCounterfactuals and comparative similarity
Counterfactuals and comparative similarity Jeremy Goodman Draft of February 23, 2015 Abstract An analysis of counterfactuals in terms of the comparative similarity of possible worlds is widely attributed
More informationNeale and the slingshot Fabrice Correia
a Neale and the slingshot Fabrice Correia 'Slingshot arguments' is a label for a class of arguments which includes Church's argument to the effect that if sentences designate propositions, then there are
More informationLogical Dynamics of Commands and Obligations
Logical Dynamics of Commands and Obligations Tomoyuki Yamada Division of Philosophy and Cultural Sciences, Graduate School of Letters, Hokkaido University Nishi 7, Kita 10, Kita-ku, Sapporo, Hokkaido,
More informationIn Defense of Jeffrey Conditionalization
In Defense of Jeffrey Conditionalization Franz Huber Department of Philosophy University of Toronto Please do not cite! December 31, 2013 Contents 1 Introduction 2 2 Weisberg s Paradox 3 3 Jeffrey Conditionalization
More informationThe Logic of Geometric Proof
The Logic of Geometric Proof Ron Rood Department of Philosophy, Vrije Universiteit Amsterdam ron.rood@planet.nl Logical studies of diagrammatic reasoning indeed, mathematical reasoning in general are typically
More informationA Qualitative Theory of Dynamic Interactive Belief Revision
A Qualitative Theory of Dynamic Interactive Belief Revision Alexandru Baltag 1 Sonja Smets 2,3 1 Computing Laboratory Oxford University Oxford OX1 3QD, United Kingdom 2 Center for Logic and Philosophy
More informationA Note on Logics of Ability
A Note on Logics of Ability Eric Pacuit and Yoav Shoham May 8, 2008 This short note will discuss logical frameworks for reasoning about an agent s ability. We will sketch details of logics of can, do,
More informationUniversity of Groningen. Arrow update logic Kooi, B.P.; Renne, B. Published in: The Review of Symbolic Logic DOI: /S
University of Groningen Arrow update logic Kooi, B.P.; Renne, B. Published in: The Review of Symbolic Logic DOI: 10.1017/S1755020311000189 IMPORTANT NOTE: You are advised to consult the publisher's version
More informationNotes on Modal Logic
Notes on Modal Logic Notes for Philosophy 151 Eric Pacuit January 25, 2009 These short notes are intended to supplement the lectures and text ntroduce some of the basic concepts of Modal Logic. The primary
More informationTopics in Social Software: Information in Strategic Situations (Draft: Chapter 4) Eric Pacuit Comments welcome:
Topics in Social Software: Information in Strategic Situations (Draft: Chapter 4) Eric Pacuit Comments welcome: epacuit@cs.gc.cuny.edu February 12, 2006 Chapter 1 Communication Graphs The previous chapter
More informationLecture 11: Topics in Formal Epistemology
Lecture 11: Topics in Formal Epistemology Eric Pacuit ILLC, University of Amsterdam staff.science.uva.nl/ epacuit epacuit@science.uva.nl Lecture Date: May 4, 2006 Caput Logic, Language and Information:
More informationJustification logic - a short introduction
Institute of Computer Science and Applied Mathematics University of Bern Bern, Switzerland January 2013 Modal Logic A Modal Logic A A B and Modal Logic A A B B and thus Modal Logic A A B B and thus A (A
More informationAgreement Theorems from the Perspective of Dynamic-Epistemic Logic
Agreement Theorems from the Perspective of Dynamic-Epistemic Logic Olivier Roy & Cedric Dégremont November 10, 2008 Olivier Roy & Cedric Dégremont: Agreement Theorems & Dynamic-Epistemic Logic, 1 Introduction
More informationLecture Notes on Classical Modal Logic
Lecture Notes on Classical Modal Logic 15-816: Modal Logic André Platzer Lecture 5 January 26, 2010 1 Introduction to This Lecture The goal of this lecture is to develop a starting point for classical
More informationSome Observations on Nabla Modality
Some Observations on Nabla Modality Can Başkent Department of Computer Science, University of Bath can@canbaskent.net www.canbaskent.net/logic 1 Introduction and Motivation The traditional necessity and
More informationFirst-Degree Entailment
March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?
More informationDirect and Indirect Consequences of Chosen and Alternative Actions
Kevin Leung Direct and Indirect Consequences of Chosen and Alternative Actions In everyday life, much of what happens is the direct consequence of the actions we take or the events we observe. I know that
More informationToday. Next week. Today (cont d) Motivation - Why Modal Logic? Introduction. Ariel Jarovsky and Eyal Altshuler 8/11/07, 15/11/07
Today Introduction Motivation- Why Modal logic? Modal logic- Syntax riel Jarovsky and Eyal ltshuler 8/11/07, 15/11/07 Modal logic- Semantics (Possible Worlds Semantics): Theory Examples Today (cont d)
More informationProving Arguments Valid in Predicate Calculus
Proving Arguments Valid in Predicate Calculus Lila Kari University of Waterloo Proving Arguments Valid in Predicate Calculus CS245, Logic and Computation 1 / 22 Predicate calculus - Logical consequence
More informationNested Epistemic Logic Programs
Nested Epistemic Logic Programs Kewen Wang 1 and Yan Zhang 2 1 Griffith University, Australia k.wang@griffith.edu.au 2 University of Western Sydney yan@cit.uws.edu.au Abstract. Nested logic programs and
More informationImperative Logic, Moods and Sentence Radicals
Imperative Logic, Moods and Sentence Radicals Berislav Žarnić The aim of this essay is to examine two challenges that the imperative logic poses to the received view of sentence moods. According to the
More informationComposing Models. Jan van Eijck, Yanjing Wang, and Floor Sietsma
Composing Models Jan van Eijck, Yanjing Wang, and Floor Sietsma Centrum Wiskunde en Informatica, P.O. Box 94079, NL-090 GB Amsterdam, The Netherlands Abstract. We study a new composition operation on (epistemic)
More informationReasoning about Fuzzy Belief and Common Belief: With Emphasis on Incomparable Beliefs
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Reasoning about Fuzzy Belief and Common Belief: With Emphasis on Incomparable Beliefs Yoshihiro Maruyama Department
More informationSpring 2017 Ling 620 The Semantics of Control Infinitives: A First Introduction to De Se Attitudes
The Semantics of Control Infinitives: A First Introduction to De Se Attitudes 1. Non-Finite Control Complements and De Se Attitudes (1) Two Sentences that Seem Very Close in Meaning a. Dave expects he
More informationModel Theory of Modal Logic Lecture 1: A brief introduction to modal logic. Valentin Goranko Technical University of Denmark
Model Theory of Modal Logic Lecture 1: A brief introduction to modal logic Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, 25 January, 2010
More informationKnowledge Based Obligations RUC-ILLC Workshop on Deontic Logic
Knowledge Based Obligations RUC-ILLC Workshop on Deontic Logic Eric Pacuit Stanford University November 9, 2007 Eric Pacuit: Knowledge Based Obligations, RUC-ILLC Workshop on Deontic Logic 1 The Kitty
More informationIn Defence of a Naïve Conditional Epistemology
In Defence of a Naïve Conditional Epistemology Andrew Bacon 28th June 2013 1 The data You pick a card at random from a standard deck of cards. How confident should I be about asserting the following sentences?
More informationMulti-agent belief dynamics: bridges between dynamic doxastic and doxastic temporal logics
Multi-agent belief dynamics: bridges between dynamic doxastic and doxastic temporal logics Johan van Benthem ILLC Amsterdam Stanford University johan@science.uva.nl Cédric Dégremont ILLC Amsterdam cdegremo@science.uva.nl
More informationKnowing Values and Public Inspection
Knowing Values and Public Inspection Malvin Gattinger with Jan van Eijck & Yanjing Wang arxiv.org/abs/1609.03338 slides at w4eg.de/malvin 2016-10-14, LIRa ILLC, Amsterdam Introduction Knowing that announcing
More informationPopulational Announcement Logic (PPAL)
Populational Announcement Logic (PPAL) Vitor Machado 1 and Mario Benevides 1,2 1 Institute of Mathematics Federal University of Rio de Janeiro 2 System Engineering and Computer Science Program (PESC/COPPE)
More informationKnowable as known after an announcement
RESEARCH REPORT IRIT/RR 2008-2 FR Knowable as known after an announcement Philippe Balbiani 1 Alexandru Baltag 2 Hans van Ditmarsch 1,3 Andreas Herzig 1 Tomohiro Hoshi 4 Tiago de Lima 5 1 Équipe LILAC
More informationResearch Statement Christopher Hardin
Research Statement Christopher Hardin Brief summary of research interests. I am interested in mathematical logic and theoretical computer science. Specifically, I am interested in program logics, particularly
More informationNotes on Modal Logic
Notes on Modal Logic Notes for PHIL370 Eric Pacuit October 22, 2012 These short notes are intended to introduce some of the basic concepts of Modal Logic. The primary goal is to provide students in Philosophy
More informationINTENSIONS MARCUS KRACHT
INTENSIONS MARCUS KRACHT 1. The Way Things Are This note accompanies the introduction of Chapter 4 of the lecture notes. I shall provide some formal background and technology. Let a language L be given
More informationT Reactive Systems: Temporal Logic LTL
Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Temporal Logic LTL Spring 2005, Lecture 4 January 31, 2005 Tik-79.186 Reactive Systems 2 Temporal Logics Temporal logics are currently the most
More informationPhilosophy 244: #8 Counterfactuals, Neighborhood Semantics, Probability, Predicative Necessity, etc.
Philosophy 244: #8 Counterfactuals, Neighborhood Semantics, Probability, Predicative Necessity, etc. Modal operators are non-truth-functional; the truth-value of α at a world is not determined by α s s
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationActs of Promising in Dynamified Deontic Logic
Acts of Promising in Dynamified Deontic Logic Tomoyuki Yamada Division of Philosophy and Cultural Sciences, Graduate School of Letters, Hokkaido University Nishi 7, Kita 10, Kita-ku, Sapporo, Hokkaido,
More informationA Game Semantics for a Non-Classical Logic
Can BAŞKENT INRIA, Nancy can@canbaskent.net www.canbaskent.net October 16, 2013 Outlook of the Talk Classical (but Extended) Game Theoretical Semantics for Negation Classical Game Theoretical Semantics
More information