Results 141 to 150 of about 25,998 (197)
Temporalizing Modal Epistemic Logic
, 2013 Timed Modal Epistemic Logic, tMEL, is a newly introduced logical framework for reasoning about the modeled agent’s knowledge. The framework, derived from the study of Justification Logic, is adapted from the traditional Modal Epistemic Logic, MEL, to serve as a logically non-omniscient epistemic logic and dealing with problems where the temporal ...
Ren-June Wang
openalex +3 more sources
Modal Deduction with Applications in Epistemic and Temporal Logics
, 1995 Abstract The widespread use of non-classical logics in Artificial Intelligence makes it desirable to have automated deduction methods (and in particular resolution methods) for these logics at our disposal. In this chapter we present several automated deduction methods for modal logics.
Luís Fariñas del Cerro, Andreas Herzig
openalex +2 more sources
Constrained Epistemic Action Modal Logic [PDF]
Advanced Science and Technology Letters, 2015 In this paper, the constrained epistemic default logic and action model logic was combined to model the dynamic cognitive update process by introducing a cognitive operator. The description of the logic framework was given in this study, and the related theorems were proved to show the interpretation of the constrained epistemic action model logic.
Zhiling Hong
openalex +2 more sources
Epistemic logic, skepticism, and non-normal modal logic
Philosophical Studies, 1981 Peter Κ. Schotch, R. E. Jennings
openalex +3 more sources
Evidence Reconstruction of Epistemic Modal Logic S5
, 2006 We introduce the logic of proofs whose modal counterpart is the modal logic S5. The language of Logic of Proofs LP is extended by a new unary operation of negative checker “?”. We define Kripke-style models for the resulting logic in the style of Fitting models and prove the corresponding Completeness theorem. The main result is the Realization theorem
Natalia Rubtsova
openalex +3 more sources
Dynamic Epistemic Logic and Temporal Modality
, 2010 Dynamic epistemic logic allows us to model agents who learn new information about the world from events which they observe. In this paper, I add a backward-looking modality to the dynamic language, to allow for our expressing statements about what an agent knew before an event took place.
Audrey Yap
openalex +3 more sources
Graded modalities in epistemic logic [PDF]
, 1992 We propose an epistemic logic with so-called graded modalities, in which certain types of knowledge are expressible that are less absolute than in traditional epistemic logic. Beside ‘absolute knowledge’ (which does not allow for any exception), we are also able to express ‘accepting ϕ if there at most n exceptions to ϕ’.
Wiebe van der Hoek, John-Jules Ch. Meyer
openaire +1 more source
Quantifier-free epistemic term-modal logic with assignment operator
Annals of Pure and Applied Logic, 2021 Abstract In standard epistemic logic, the names and the existence of agents are usually assumed to be common knowledge implicitly. This is unreasonable for various applications in computer science and philosophy. Inspired by term-modal logic and assignment operators in dynamic logic, we introduce a lightweight modal predicate logic where names can be
Yanjing Wang, Yu Wei, Jeremy Seligman
openalex +3 more sources
Concrete Epistemic Modal Logic: Flatland [PDF]
, 2011 In this paper, we give a logic for perception and knowledge: Flatland. This semantics of this framework is a concrete Kripke model so that it is an easy-to-understand toy example for students. We present a piece of software called Plaza's world enabling to check formulas in such a concrete Kripke model and to announce formulas.
Olivier Gasquet +1 more
openaire +1 more source
Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences All Together [PDF]
, 2009 We present in this work a sound and complete modal logic called EDLA (Epistemic Dynamic Logic of Agency) integrating the concepts of joint action, preference and knowledge and enabling to reason about epistemic games in strategic form. We provide complexity results for EDLA.
Emiliano Lorini +2 more
openalex +5 more sources