Filters








49 Hits in 2.1 sec

Coalgebraic Epistemic Update Without Change of Model [chapter]

Corina Cîrstea, Mehrnoosh Sadrzadeh
Algebra and Coalgebra in Computer Science  
The generality and abstraction of our coalgebraic model turns out to be extremely useful in proving preservation properties of update.  ...  Our model directly gives rise to a coalgebraic logic with both dynamic and epistemic modalities.  ...  This is contrary to the models of e.g. [10, 3, 1] that require subsequent "changes" to the epistemic structure to model the dynamics.  ... 
doi:10.1007/978-3-540-73859-6_11 dblp:conf/calco/CirsteaS07 fatcat:mfizud23sjerxee7kpsms3qyga

A Coalgebraic Semantics for Epistemic Programs

Alexandru Baltag
2003 Electronical Notes in Theoretical Computer Science  
I show that the "relational" semantics of epistemic programs, given in [BMS2] in terms of epistemic updates, can be understood in terms of functors on the category of coalgebras and natural transformations  ...  This paper gives a fresh look at my previous work on "epistemic actions" and information updates in distributed systems, from a coalgebraic perspective.  ...  ≡ skip, which shows that (impersonal, public) questions induce no informational changes on a given epistemic model. Disadvantages of the Update Semantics.  ... 
doi:10.1016/s1571-0661(04)80630-3 fatcat:5te2d3kaezaz7eaxdq7ef63urm

Dynamic Epistemic Logic Displayed [chapter]

Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano
2013 Lecture Notes in Computer Science  
We introduce a display calculus for the logic of Epistemic Actions and Knowledge (EAK) of Baltag-Moss-Solecki.  ...  The additional dynamic operators do not have an interpretation in the standard Kripke semantics of EAK, but do have a natural interpretation in the final coalgebra.  ...  Indeed, they are designed to formalize change caused by actions of diverse nature: updates on the memory state of a computer, displacements of moving robots in an environment, measurements in models of  ... 
doi:10.1007/978-3-642-40948-6_11 fatcat:mwklxssrwzhhrhahy2tbj3ianu

A proof-theoretic semantic analysis of dynamic epistemic logic

Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano, Vlasta Sikimić
2014 Journal of Logic and Computation  
The present paper provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics.  ...  Dynamic epistemic logic is one of the best known members of a family of logical systems which have been successfully applied to diverse scientific disciplines, but the proof theoretic treatment of which  ...  Intuitively, the tuple µ, n stands for an epistemic state of the model updated with a sequence of announcements encoded by µ.  ... 
doi:10.1093/logcom/exu063 fatcat:im7schyimraarauhbockei3dim

Categories for Dynamic Epistemic Logic

Kohei Kishida
2017 Electronic Proceedings in Theoretical Computer Science  
Several virtues of the new formulation will be demonstrated: The DEL idea of updating a model into another is captured naturally by the categorical perspective -- which emphasizes a family of objects and  ...  The primary goal of this paper is to recast the semantics of modal logic, and dynamic epistemic logic (DEL) in particular, in category-theoretic terms.  ...  See Proposition 1 in Section V.4 of [24] . This is the case without "factual change". A version with factual change [9] can also be treated categorically.  ... 
doi:10.4204/eptcs.251.26 fatcat:cac7fngi7jepfnosxoggyfxcnu

A Compositional Coalgebraic Semantics of Strategic Games [article]

Achim Blumensath, Viktor Winschel
2017 arXiv   pre-print
In our framework, like in the semantics of functional programming languages, coalgebras represent the observable behaviour of systems derived from the behaviour of the parts over an unobservable state  ...  We provide a compositional coalgebraic semantics for strategic games.  ...  Let γ : S → Γ(S) be a game without players and let ω : Ω → Γ(Ω) be the final Γ-coalgebra.  ... 
arXiv:1712.08381v1 fatcat:avuqo24yizckncludk3zjdduom

An Algebraic Approach to Dynamic Epistemic Logic

Prakash Panangaden, Caitlin Phillips, Doina Precup, Mehrnoosh Sadrzadeh
2010 International Workshop on Description Logics  
Sadrzadeh [14] to include both communication actions and dynamic actions that change the state of the system.  ...  Furthermore, we propose a new modality that captures both epistemic and propositional changes resulting from the agents' actions.  ...  Acknowledgements This research was supported in part by NSERC, FQRNT, the Office of Naval Research, the Fields Institute and a Dean's Excellence fellowship from McGill University.  ... 
dblp:conf/dlog/PanangadenPPS10 fatcat:qh332vrlmncclfcimdato2ezsi

Logics for Epistemic Programs

Alexandru Baltag, Lawrence S. Moss
2004 Synthese  
Program models induce changes affecting agents' information, which we represent as changes of the state model, called epistemic updates.  ...  The update product is used to obtain from any program model the corresponding epistemic update, thus allowing us to compute changes of information or belief.  ...  To model the effect of an epistemic update on a state, we use a kind of product of epistemic alternatives. Epistemic Action Models Let be the collection of all epistemic propositions.  ... 
doi:10.1023/b:synt.0000024912.56773.5e fatcat:zabpio73vje53dylvztg6kft6u

Logics for Epistemic Programs [chapter]

Alexandru Baltag, Lawrence S. Moss
2004 Information, Interaction and Agency  
Program models induce changes affecting agents' information, which we represent as changes of the state model, called epistemic updates.  ...  The update product is used to obtain from any program model the corresponding epistemic update, thus allowing us to compute changes of information or belief.  ...  To model the effect of an epistemic update on a state, we use a kind of product of epistemic alternatives. Epistemic Action Models Let be the collection of all epistemic propositions.  ... 
doi:10.1007/1-4020-4094-6_1 fatcat:bfnuv4wn6zfzze5s3jqs7qqsqm

Algebra and Sequent Calculus for Epistemic Actions

Alexandru Baltag, Bob Coecke, Mehrnoosh Sadrzadeh
2005 Electronical Notes in Theoretical Computer Science  
This approach has the advantage that: (i) its semantics is a transparent algebraic object with a minimal set of primitives from which most ingredients of Dynamic Epistemic Logic arise, (ii) it goes with  ...  We introduce an algebraic approach to Dynamic Epistemic Logic.  ...  Now the outsider C will secretly intercept the message, change it appropriately and send it to B without knowing the secret.  ... 
doi:10.1016/j.entcs.2004.11.012 fatcat:4qujhiamt5gkfiet2xmpv3rrra

Conditional Doxastic Models: A Qualitative Approach to Dynamic Belief Revision

Alexandru Baltag, Sonja Smets
2006 Electronical Notes in Theoretical Computer Science  
Moving then to belief updates (sometimes called "dynamic" belief revision) induced by epistemic actions, we consider two particular cases: public announcements and private announcements to subgroups of  ...  In this paper, we present a semantical approach to multi-agent belief revision and belief update. For this, we introduce relational structures called conditional doxastic models (CDM's, for short).  ...  As in the simpler case of purely epistemic updates with a private announcement (without belief revision) in [5] , one can also obtain a complete axiomatization of the logic with common knowledge and common  ... 
doi:10.1016/j.entcs.2006.05.034 fatcat:cjxhzwk7gfathgwgcgdowo52u4

A Dynamic-Logical Perspective on Quantum Behavior

A. Baltag, S. Smets
2008 Studia Logica: An International Journal for Symbolic Logic  
In this paper we show how recent concepts from Dynamic Logic, and in particular from Dynamic Epistemic logic, can be used to model and interpret quantum behavior.  ...  We give a logical analysis of quantum measurements (formalized using modal operators) as triggers for quantum information flow, and we compare them with other logical operators previously used to model  ...  This paper benefited from the fruitful discussions that took place during the ESF Exploratory Workshop on Applied Logic in the Methodology of Science in Bristol 2006.  ... 
doi:10.1007/s11225-008-9126-5 fatcat:jujcxc55c5ctjig4nu273imzxm

Weakly-coupled ontology integration of P2P database systems

Zoran Majkic
2004 Peer-to-Peer Knowledge Management  
We show that the algorithm computes its answers according to a generalized epistemic modal S5 logic, where frames are partitioned according to the structure of peers.  ...  This new semantics for P2P systems models a kind of intensional mapping that is fundamentally different from the GLAV (Global and Local As View) extensional mappings, traditionally adopted in data integration  ...  The main goal for this work i to obtain the more flexible and modular P2P systems, where each peer can be updated without any external constraint.  ... 
dblp:conf/p2pkm/Majkic04 fatcat:lxmsc3qxcngonpmehf7crgudba

Bridging Disciplinary Gaps in Studies of Human-Environment Relations: A Modelling Framework

Michael Hauhs, Baltasar Trancón y Widemann, Georg Klute
2018 Modern Africa  
flexible framework of a few model types.  ...  The generalised framework contains four ideal types of modelling paradigms. It can be tested on various other classification schemes in a number of disciplines.  ...  However, under a changing climate the expertise to be represented in these models may require continuous updating.  ... 
doi:10.26806/modafr.v5i2.196 fatcat:i2ffizqfjrgfvjar4t7kwem4mu

Sigma algebras in probabilistic epistemic dynamics

Luca Aceto, Wiebe van der Hoek, Anna Ingolfsdottir, Joshua Sack
2011 Proceedings of hte 13th Conference on Theoretical Aspects of Rationality and Knowledge - TARK XIII  
This paper extends probabilistic dynamic epistemic logic from a finite setting to an infinite setting, by introducing σ-algebras to the probability spaces in the models.  ...  It is shown that the dynamics preserves desirable properties of measurability and that completeness of the proof system holds with the extended semantics.  ...  [Update product] The update product between a probabilistic epistemic model M and an L-update frame U is the probabilistic epistemic model M [U ] with the first three components: • X M [U ] = {(x, e) |  ... 
doi:10.1145/2000378.2000401 dblp:conf/tark/AcetoHIS11 fatcat:rrmm47zakncenluvwgahvchvwy
« Previous Showing results 1 — 15 out of 49 results