Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Questions of the Reviewers
References
All Topics
Philosophy
Logic

Epistemic Logics with Structured Knowledge

Profile image of Manuel MartinsManuel Martins

2019, Electronic Notes in Theoretical Computer Science

Abstract

Multi-agent Dynamic Epistemic Logic, as a suitable modal logic to reason about knowledge evolving systems, has been emerged in a number of contexts and scenarios. The agents knowledge in this logic is simply characterised by valuations of propositions. This paper discusses the adoption of other richer structures to make these representations, as graphs, algebras or even epistemic models. This method of building epistemic logics over richer structures is called "Epistemisation". On this view a parametric method to build such Epistemic Logics with Public Announcements is introduced. Moreover, a parametric notion of bisimulation is presented, and the modal invariance of the proposed logics, with respect to this relation, are proved. Some interesting application horizons opened with this construction are stated.

Related papers

Dynamic Epistemic Logic
Jelle Gerbrandy

1998

View PDFchevron_right
A New Approach to Epistemic Logic
Gabriele Tassi, Giovanna Corsi

A new language for epistemic logic is introduced in which the epistemic operators are of the form | x : x_1.... x_n | with the intended reading "x knows of x_1 .... x_n that ...''. Analogously we can express "t knows of t_1 .... t_n that ... '', where t, t_1.... t_n are terms. An advantage of this approach is that we can quantify on the agents, "every y knows of x_1.... x_n that A'' or "some expert knows of t_1.... t_n that A'' can easily be expressed. The semantics we present for this language is a generalization of the transition semantics, called "epistemic transition semantics" in which the possible worlds are states of affairs compatible with the epistemic state of some agent. A calculus is presented and shown to be complete with respect to epistemic transition semantics.

View PDFchevron_right
A Complete Epistemic Logic for Multiple Agents
W. Van Der Hoek

Theory and Decision Library, 1997

In the field of Artificial Intelligence and Computer Science, the modal system S5 is a familiar logic to model knowledge. Although the system on the one hand models an idealized notion of knowledge (the epistemic agent is assumed to be fully introspective, for example, and S5 knowledge also suffers from the problem of logical omniscience-the agent knows all logical validities, and his knowledge is closed under logical consequence-see Wansing, 1990 for a discussion and relaxations of these properties), its nice mathematical properties, on the other hand, often motivate researchers to adopt this system in their first exploration of the field. Then, for specific purposes, such as decisionand game-theoretic applications, some or many of these idealizations concerning introspective properties or logical omniscience are given up or, sometimes, replaced by weaker assumptions about knowledge. It is a well-known fact that the idealized modal system S5 exactly describes the valid formulas of Kripke models in which the accessibility relation is an equivalence relation. In the case of one agent, one may use a result about preservation of truth under taking so-called generated sub-models (the formulas 35

View PDFchevron_right
A Four-Valued Dynamic Epistemic Logic
Yuri David Santos

Journal of Logic, Language and Information

Epistemic logic is usually employed to model two aspects of a situation: the factual and the epistemic aspects. Truth, however, is not always attainable, and in many cases we are forced to reason only with whatever information is available to us. In this paper, we will explore a four-valued epistemic logic designed to deal with these situations, where agents have only knowledge about the available information (or evidence), which can be incomplete or conflicting, but not explicitly about facts. This layer of available information or evidence, which is the object of the agents’ knowledge, can be seen as a database. By adopting this sceptical posture in our semantics, we prepare the ground for logics where the notion of knowledge—or more appropriately, belief—is entirely based on evidence. The technical results include a set of reduction axioms for public announcements, correspondence proofs, and a complete tableau system. In summary, our contributions are twofold: on the one hand we ...

View PDFchevron_right
Connecting dynamic epistemic and temporal epistemic logics
Hans van Ditmarsch

Logic Journal of IGPL, 2013

We give a relation between a logic of knowledge and change, with a semantics on Kripke models, and a logic of knowledge and time, with a semantics on interpreted systems. In particular, given an epistemic state (pointed Kripke model with equivalence relations) and a formula in a dynamic epistemic logic (a logic describing the consequences of epistemic actions), we construct an interpreted system relative to that epistemic state and that formula that satisfies the translation of the formula into a temporal epistemic logic. The construction involves that the protocol that is implicit in the dynamic epistemic formula, i.e., the set of sequences of actions being executed to evaluate the formula, is made explicit. We first focus on the logic of knowledge and change that is known as public announcement logic, then generalize our results to a dynamic epistemic logic. When compared to Kripke (possible worlds) models, interpreted systems have at least two appealing features: a natural accessibility relation between domain objects, and an equally natural notion of dynamics, modelled by runs. The accessibility relation as we know it from the possible worlds model is in this case grounded; it has a direct and natural interpretation, as follows. In an interpreted system, the role of possible worlds is performed by global states, which are constituted by the agents' local states and the state of the environment. Each agent knows exactly its own local state and the possible local states of other agents: two global states are indistinguishable for an agent if his local compartment is the same. Secondly, an interpreted system defines a number of runs through such global states (i.e., a sequence of global states). Each run corresponds to a possible computation allowed by a protocol. In an object language with temporal and epistemic operators one can then express temporal properties such as liveness and temporal epistemic properties such as perfect recall.

View PDFchevron_right
Epistemic Logic with Relevant Agents
Ondrej Majer

2015

The aim of epistemic logics is to formalize epistemic states and actions of (possibly human) rational agents. A traditional means for representing these states and actions employs the framework of modal logics, where knowledge corresponds to some necessity operator. Modal axioms (K, T, 4, 5,...) then

View PDFchevron_right
Hybrid Epistemic logic for Specifying Requirements of Multi-agent Systems
Journal of Computer Science IJCSIS

Several attempts proposed epistemic logic to specify and reason about the knowledge of agents with a discrete model of time. Many extensions of this logic have been seen in the literature to specify and reason about agents' knowledge in the real time. On the other hand, hybrid automata have been proposed as a formal model of hybrid systems. They have also been approached to model group of agents situated in continuous dynamic environment. To specify and reason about the requirements of this model, we defined a logic called RCTL in a previous work. However, a group of agents have to communicate and share their Knowledge not only in timed systems but also in continuous dynamical systems. Thus, a new logic is needed to specify the qualitative and quantitative knowledge of agents. This paper proposes a novel Logic called ERCTL that extends the logic RCTL to specify the epistemic knowledge of agents as evolution of continuous actions over time.

View PDFchevron_right
Logics of communication and change
Barteld Kooi

Information and Computation, 2006

Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that extend the epistemic base language with a new notion of 'relativized common knowledge', in such a way that the resulting full dynamic logic of information flow allows for a compositional analysis of all epistemic postconditions via perspicuous 'reduction axioms'. We also show how such systems can deal with factual alteration, rather than just information change, making them cover a much wider range of realistic events. After a warm-up stage of analyzing logics for public announcements, our main technical results are expressivity and completeness theorems for a much richer logic that we call LCC. This is a dynamic epistemic logic whose static base is propositional dynamic logic (PDL), interpreted epistemically. This system is capable of expressing all modelshifting operations with finite action models, while providing a compositional analysis for a wide range of informational events. This makes LCC a serious candidate for a standard in dynamic epistemic logic, as we illustrate by analyzing some complex communication scenarios, including sending successive emails with both 'cc' and 'bcc' lines, and other private announcements to subgroups. Our proofs involve standard modal techniques, combined with a new application of Kleene's Theorem on finite automata, as well as new Ehrenfeucht games of model comparison.

View PDFchevron_right
Adding Proof Calculi to Epistemic Logics with Structured Knowledge
Manuel Martins

Fundamentals of Software Engineering, 2021

Dynamic Epistemic Logic (DEL) is used in the analysis of a wide class of application scenarios involving multi-agents systems with local perceptions of information and knowledge. In its classical form, the knowledge of epistemic states is represented by sets of propositions. However, the complexity of the current systems, requires other richer structures, than sets of propositions, to represent knowledge on their epistemic states. Algebras, graphs or distributions are examples of useful structures for this end. Based on this observation, we introduced a parametric method to build dynamic epistemic logics on-demand, taking as parameter the specific knowledge representation framework (e.g., propositional, equational or even a modal logic) that better fits the problems in hand. In order to use the built logics in practices, tools support is needed. Based on this, we extended our previous method with a parametric construction of complete proof calculi. The complexity of the model checking and satisfiability problems for the achieved logics are provided.

View PDFchevron_right

References (31)

  1. Philippe Balbiani, Olivier Gasquet, and Franois Schwarzentruber. Agents that look at one another. Logic Journal of the IGPL, 21(3):438-467, 2013.
  2. Pedro Baltazar. Probabilization of Logic Systems. PhD thesis, Instituto Superior Técnico de Lisboa, 2010.
  3. Mario Benevides, Alexandre Madeira, and Manuel Martins. A famuly of graded epistemic logics. In 12th Workshop on Logical and Semantic Frameworks with Applications, volume 338 of Electronic Notes in Theoretical Computer Science, Elsevier, 2018.
  4. P. Blackburn and B. ten Cate. Pure Extensions, Proof Rules and Hybrid Axiomatics. In R. Schmidt, I. Pratt-Hartmann, M. Reynolds, and H. Wansing, editors, Proceedings of the Advances in Modal Logic 2004 (AiML 2004), 2004.
  5. Stanley Burris and H. P. Sankappanavar. A Course in Universal Algebra. Springer, 1981.
  6. Carlos Caleiro, Cristina Sernadas, and Amílcar Sernadas. Parameterisation of logics. In J. L. Fiadeiro, editor, Recent Trends in Algebraic Development Techniques (Revised Selected Papers of WADT '98, Lisbon, Portugal, April, 2-4, 1998), volume 1589 of Lecture Notes in Computer Science, pages 48-62. Springer, 1999.
  7. Walter Carnielli and Marcelo Esteban Coniglio. Combining logics. In Edward N. Zalta, editor, The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, winter 2016 edition, 2016.
  8. Andrea Corradini, Bartek Klin, and Corina Cîrstea, editors. Algebra and Coalgebra in Computer Science -4th International Conference, CALCO 2011, Winchester, UK, August 30 -September 2, 2011. Proceedings, volume 6859 of Lecture Notes in Computer Science. Springer, 2011.
  9. Rȃzvan Diaconescu and Petros S. Stefaneas. Ultraproducts and possible worlds semantics in institutions. Theor. Comput. Sci., 379(1-2):210-230, 2007.
  10. R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning about Knowledge. MIT Press, USA, 1995.
  11. Rogerio Fajardo and Marcelo Finger. Non-normal modalisation. In P. Balbiani, N.-Y. Suzuki, F. Wolter, and M. Zakharyaschev, editors, Advances in Modal Logic 4 (Toulouse, France, October 2002), pages 83-96, 2002.
  12. Francicleber Martins Ferreira, Cibele Matos Freire, Mario R. F. Benevides, L. Menasché Schechter, and Ana Teresa C. Martins. Hybrid logics and NP graph properties. In Lev D. Beklemishev and Ruy J. G. B. de Queiroz, editors, Logic, Language, Information and Computation -18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011. Proceedings, volume 6642 of Lecture Notes in Computer Science, pages 123-134. Springer, 2011.
  13. Marcelo Finger and Dov Gabbay. Adding a temporal dimension to a logic adding a temporal dimension to a logic system. Journal of Logic, Language and Information, 1(3), 1992.
  14. M. Fitting and R.L. Mendelsohn. First-Order Modal Logic. Synthese Library Studies in Epistemology Logic, Methodology, and Philosophy of Science Volume 277. Springer Netherlands, 1998.
  15. Petr Hájek. Basic fuzzy logic and bl-algebras. Soft Comput., 2(3):124-128, 1998.
  16. Andreas Herzig, Emiliano Lorini, and Faustine Maffre. A poor man's epistemic logic based on propositional assignment and higher-order observation. In Wiebe van der Hoek, Wesley H. Holliday, and Wen-fang Wang, editors, Logic, Rationality, and Interaction, pages 156-168, Berlin, Heidelberg, 2015. Springer Berlin Heidelberg.
  17. J. Hintikka. Knowledge and Belief. Cornell University Press, Ithaca, N.Y, 1962.
  18. Barteld P. Kooi. Probabilistic dynamic epistemic logic. Journal of Logic, Language and Information, 12(4):381-408, Sep 2003.
  19. Alexandre Madeira, Renato Neves, Luís Soares Barbosa, and Manuel A. Martins. A method for rigorous design of reconfigurable systems. Sci. Comput. Program., 132:50-76, 2016.
  20. Alexandre Madeira, Renato Neves, and Manuel A. Martins. An exercise on the generation of many-valued dynamic logics. J. Log. Algebr. Meth. Program., 85(5):1011-1037, 2016.
  21. Renato Neves, Alexandre Madeira, Luís Soares Barbosa, and Manuel A. Martins. Asymmetric combination of logics is functorial: A survey. In Recent Trends in Algebraic Development Techniques -23rd IFIP WG 1.3 International Workshop, WADT 2016, Gregynog, UK, September 21-24, 2016, Revised Selected Papers, pages 39-55, 2016.
  22. Renato Neves, Alexandre Madeira, Manuel A. Martins, and Luís Soares Barbosa. Proof theory for hybrid(ised) logics. Sci. Comput. Program., 126:73-93, 2016.
  23. Nils J. Nilsson. Probabilistic logic. Artif. Intell., 28(1):71-88, February 1986.
  24. André Platzer. Logical Foundations of Cyber-Physical Systems. Springer, Switzerland, 2018.
  25. João Rasga, Amílcar Sernadas, and Cristina Sernadas. Importing logics. Studia Logica, 100(3):545-581, 2012.
  26. Wiebe van der Hoek, Petar Iliev, and Michael Wooldridge. A logic of revelation and concealment. In International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012, Valencia, Spain, June 4-8, 2012 (3 Volumes), pages 1115-1122, 2012.
  27. Wiebe van der Hoek, Nicolas Troquard, and Michael Wooldridge. Knowledge and control. In 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taipei, Taiwan, May 2-6, 2011, Volume 1-3, pages 719-726, 2011.
  28. H. van Ditmarsch, W. van der Hoek, and B. Kooi. Dynamic Epistemic Logic. Synthese Library Series, volume 337. Springer, The Netherland, 2008.
  29. Jan van Eijck and Malvin Gattinger. Elements of epistemic crypto logic. In Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS '15, pages 1795-1796, Richland, SC, 2015. International Foundation for Autonomous Agents and Multiagent Systems.
  30. Jan van Eijck, Malvin Gattinger, and Yanjing Wang. Knowing values and public inspection. In Sujata Ghosh and Sanjiva Prasad, editors, Logic and Its Applications, pages 77-90, Berlin, Heidelberg, 2017. Springer Berlin Heidelberg.
  31. Yanjing Wang. Beyond Knowing That: A New Generation of Epistemic Logics, pages 499-533. Springer International Publishing, Cham, 2018.

Related papers

A Dynamic Informational-Epistemic Logic
Yuri David Santos

Dynamic Logic. New Trends and Applications - Lecture Notes in Computer Science, 2017

Epistemic logic is usually employed to model two aspects of a situation: the ontic and the epistemic aspects. Truth, however, is not always attainable, and in many cases we are forced to reason only with whatever information is available to us. In this paper, we will explore a four-valued epistemic logic designed to deal with situations of this sort. The technical results include a set of reduction axioms for public announcements, correspondence proofs, and a complete tableau system.

View PDFchevron_right
Reasoning about dynamic epistemic logic
Alexandru Baltag, Mehrnoosh Sadrzadeh, Bob Coecke

2004

Abstract We present an algebra and sequent calculus to reason about dynamic epistemic logic, a logic for information update in multi-agent systems. We contribute to it by equipping it with a logical account of resources, a semi-automatic way of reasoning through the algebra and sequent calculus, and finally by generalizing it to non-boolean settings.

View PDFchevron_right
A logic toolbox for modeling knowledge and information in multi-agent systems and social epistemology
Jens Ulrik Hansen

Roskilde University Computer Science Research Reports #133, ISSN 0109-9779, September 2011., 2011

"This dissertation consists of a collection of papers on pure and applied modal logics preceded by an introduction that ties them together. The papers and the variety of topics discussed in them can be viewed as a contribution to a logic toolbox. More specifically, a logic toolbox streamlined to model information, knowledge, and beliefs. The logic tools have many applications in various fields such as computer science, philosophy, mathematics, linguistics, economics, and other social sciences, but in this thesis the focus will be on their application in social epistemology and multi-agent systems. After the introduction, which outlines the logic toolbox and some of its applications, follow four technical chapters that expand the logic toolbox (chapters 2, 3, 4, and 5) and two chapters that show the logic tools at work (chapters 6 and 7). In Chapter 2 a many-valued hybrid logic is introduced and a sound, complete, and terminating tableau system is given. Chapter 3 is a supplement to Chapter 2 and discusses various alternative definitions of the semantics of the hybrid part of the many-valued hybrid logic. Chapter 4 combines public announcement logic with hybrid logic and gives a sound and complete axiomatisation of the logic as well as discussing extensions with other modalities such as distributed knowledge. In Chapter 5, terminating tableau systems using reduction axioms as rules are given for standard dynamic epistemic logic as well as the hybrid public announcement logic of Chapter 4. Chapter 6 uses a dynamic epistemic logic to model the phenomenon of pluralistic ignorance. Finally, Chapter 7 uses first-order logic and description logic to discuss foundational issues in knowledge representation of regulatory relations in biomedical pathways. This dissertation makes numerous contributions to the field of which the following three are the most important: - A detailed investigation of the combination of hybrid logic and public announcement logic, showing in particular that the proof theoretic advantages of hybrid logic (such as automatic completeness with pure formulas) extend to hybrid public announcement logic (chapters 4 and 5). - An approach to constructing terminating tableau systems for hybrid logics is shown to be extremely general in the sense that it extends to both many-valued hybrid logic (Chapter 2), dynamic epistemic logic, and hybrid public announcement logic (Chapter 5). - This dissertation touches upon the issue of how knowledge and beliefs of a group of agents relate to the knowledge and beliefs of the individuals of the group. How knowledge or beliefs of the individual agents can be aggregated to yield group knowledge or group beliefs is studied in Section 1.3.3 of the introduction, and how information and beliefs flow among a group of agents involved in the phenomenon of pluralistic ignorance is studied in Chapter 6."

View PDFchevron_right
Dynamic Epistemic Logics
Jan van Eijck

Outstanding Contributions to Logic, 2014

Dynamic epistemic logic, broadly conceived, is the study of rational social interaction in context, the study, that is, of how agents update their knowledge and change their beliefs on the basis of pieces of information they exchange in various ways. The information that gets exchanged can be about what is the case in the world, about what changes in the world, and about what agents know or believe about the world and about what others know or believe. This chapter gives an overview of dynamic epistemic logics, and traces some connections with propositional dynamic logic, with planning and with probabilistic updating.

View PDFchevron_right
An algebraic approach to dynamic epistemic logic
Caitlin Phillips

23rd International Workshop on Description Logics DL2010, 2010

Abstract. Dynamic epistemic logic plays a key role in reasoning about multi-agent systems. Past approaches to dynamic epistemic logic have typically been focused on actions whose primary purpose is to communicate information from one agent to another. These actions are unable to alter the valuation of any proposition within the system. In fields such as security, it is easy to imagine situations in which this sort of action would be insufficient. We expand the algebraic framework presented by M. Sadrzadeh [14] to include both communication ...

View PDFchevron_right

Related topics

  • Cognitive Science
  • Modal Logic
  • Computer Science
  • Epistemology
  • Dynamic Epistemic Logic
  • Multimodal Logic
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved