35 found
Order:
  1.  98
    On axiomatizations of public announcement logic.Yanjing Wang & Qinxiang Cao - 2013 - Synthese 190 (S1).
    In the literature, different axiomatizations of Public Announcement Logic (PAL) have been proposed. Most of these axiomatizations share a “core set” of the so-called “reduction axioms”. In this paper, by designing non-standard Kripke semantics for the language of PAL, we show that the proof system based on this core set of axioms does not completely axiomatize PAL without additional axioms and rules. In fact, many of the intuitive axioms and rules we took for granted could not be derived from the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   37 citations  
  2. Contingency and Knowing Whether.Jie Fan, Yanjing Wang & Hans van Ditmarsch - 2015 - Review of Symbolic Logic 8 (1):75-107.
    A proposition is noncontingent, if it is necessarily true or it is necessarily false. In an epistemic context, ‘a proposition is noncontingent’ means that you know whether the proposition is true. In this paper, we study contingency logic with the noncontingency operator? but without the necessity operator 2. This logic is not a normal modal logic, because?→ is not valid. Contingency logic cannot define many usual frame properties, and its expressive power is weaker than that of basic modal logic over (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  3. A logic of knowing why.Chao Xu, Yanjing Wang & Thomas Studer - 2021 - Synthese 198 (2):1259-1285.
    When we say “I know why he was late”, we know not only the fact that he was late, but also an explanation of this fact. We propose a logical framework of “knowing why” inspired by the existing formal studies on why-questions, scientific explanation, and justification logic. We introduce the Kyi\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal {K}}{}\textit{y}}_i$$\end{document} operator into the language of epistemic logic to express “agent i knows why φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...)
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  4.  93
    A logic of goal-directed knowing how.Yanjing Wang - 2018 - Synthese 195 (10):4419-4439.
    In this paper, we propose a decidable single-agent modal logic for reasoning about goal-directed “knowing how”, based on ideas from linguistics, philosophy, modal logic, and automated planning in AI. We first define a modal language to express “I know how to guarantee \ given \” with a semantics based not on standard epistemic models but on labeled transition systems that represent the agent’s knowledge of his own abilities. The semantics is inspired by conformant planning in AI. A sound and complete (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  5. Epistemic Modelling and Protocol Dynamics.Yanjing Wang - 2010 - Dissertation, University of Amsterdam
     
    Export citation  
     
    Bookmark   16 citations  
  6.  36
    Planning-based knowing how: A unified approach.Yanjun Li & Yanjing Wang - 2021 - Artificial Intelligence 296 (C):103487.
  7.  36
    Bisimulations for Knowing How Logics.Raul Fervari, Fernando R. Velázquez-Quesada & Yanjing Wang - 2022 - Review of Symbolic Logic 15 (2):450-486.
    As a new type of epistemic logics, the logics of knowing how capture the high-level epistemic reasoning about the knowledge of various plans to achieve certain goals. Existing work on these logics focuses on axiomatizations; this paper makes the first study of their model theoretical properties. It does so by introducing suitable notions of bisimulation for a family of five knowing how logics based on different notions of plans. As an application, we study and compare the expressive power of these (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  43
    Quantifier-free epistemic term-modal logic with assignment operator.Yanjing Wang, Yu Wei & Jeremy Seligman - 2022 - Annals of Pure and Applied Logic 173 (3):103071.
  9. Reasoning About Agent Types and the Hardest Logic Puzzle Ever.Fenrong Liu & Yanjing Wang - 2013 - Minds and Machines 23 (1):123-161.
    In this paper, we first propose a simple formal language to specify types of agents in terms of necessary conditions for their announcements. Based on this language, types of agents are treated as ‘first-class citizens’ and studied extensively in various dynamic epistemic frameworks which are suitable for reasoning about knowledge and agent types via announcements and questions. To demonstrate our approach, we discuss various versions of Smullyan’s Knights and Knaves puzzles, including the Hardest Logic Puzzle Ever (HLPE) proposed by Boolos (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  10.  44
    Almost Mecessary.Jie Fan, Yanjing Wang & Hans van Ditmarsch - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10: Papers From the Tenth Aiml Conference, Held in Groningen, the Netherlands, August 2014. London, England: CSLI Publications. pp. 178-196.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  11.  85
    True lies.Thomas Ågotnes, Hans van Ditmarsch & Yanjing Wang - 2018 - Synthese 195 (10):4581-4615.
    A true lie is a lie that becomes true when announced. In a logic of announcements, where the announcing agent is not modelled, a true lie is a formula that becomes true when announced. We investigate true lies and other types of interaction between announced formulas, their preconditions and their postconditions, in the setting of Gerbrandy’s logic of believed announcements, wherein agents may have or obtain incorrect beliefs. Our results are on the satisfiability and validity of instantiations of these semantically (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  12.  37
    Conditionally Knowing What.Yanjing Wang & Jie Fan - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10: Papers From the Tenth Aiml Conference, Held in Groningen, the Netherlands, August 2014. London, England: CSLI Publications. pp. 569-587.
  13. Hidden protocols: Modifying our expectations in an evolving world.Hans van Ditmarsch, Sujata Ghosh, Rineke Verbrugge & Yanjing Wang - 2014 - Artificial Intelligence 208 (1):18--40.
    When agents know a protocol, this leads them to have expectations about future observations. Agents can update their knowledge by matching their actual observations with the expected ones. They eliminate states where they do not match. In this paper, we study how agents perceive protocols that are not commonly known, and propose a semantics-driven logical framework to reason about knowledge in such scenarios. In particular, we introduce the notion of epistemic expectation models and a propositional dynamic logic-style epistemic logic for (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  14.  69
    Inquisitive logic as an epistemic logic of knowing how.Haoyu Wang, Yanjing Wang & Yunsong Wang - 2022 - Annals of Pure and Applied Logic 173 (10):103145.
  15. On the logic of lying.Hans van Ditmarsch, Jan van Eijck & Yanjing Wang - unknown
    We look at lying as an act of communication, where (i) the proposition that is communicated is not true, (ii) the utterer of the lie knows that what she communicates is not true, and (iii) the utterer of the lie intends the lie to be taken as truth. Rather than dwell on the moral issues, we provide a sketch of what goes on logically when a lie is communicated. We present a complete logic of manipulative updating, to analyse the effects (...)
     
    Export citation  
     
    Bookmark   10 citations  
  16.  47
    Mereological Bimodal Logics.Li Dazhu & Yanjing Wang - 2022 - Review of Symbolic Logic 15 (4):823-858.
    In this paper, using a propositional modal language extended with the window modality, we capture the first-order properties of various mereological theories. In this setting,$\Box \varphi $readsall the parts(of the current object)are$\varphi $, interpreted on the models with awhole-partbinary relation under various constraints. We show that all the usual mereological theories can be captured by modal formulas in our language via frame correspondence. We also correct a mistake in the existing completeness proof for a basic system of mereology by providing (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17. Propositional Dynamic Logic as a Logic of Belief Revision Vol. 5110 Lnai.Jan van Eijck & Yanjing Wang - 2008
    This paper shows how propositional dynamic logic can be interpreted as a logic for multi-agent belief revision. For that we revise and extend the logic of communication and change of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausibilities, add their converses, and build knowledge and belief operators from these with the PDL constructs. We extend the update mechanism of LCC to an update mechanism that handles belief change as (...)
     
    Export citation  
     
    Bookmark   6 citations  
  18.  48
    "Knowing value" logic as a normal modal logic.Tao Gu & Yanjing Wang - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 362-381.
  19.  20
    A dynamic epistemic framework for reasoning about conformant probabilistic plans.Yanjun Li, Barteld Kooi & Yanjing Wang - 2019 - Artificial Intelligence 268 (C):54-84.
  20. Weakly Aggregative Modal Logic: Characterization and Interpolation.Jixin Liu, Yanjing Wang & Yifeng Ding - 2019 - In Patrick Blackburn, Emiliano Lorini & Meiyun Guo (eds.), Logic, Rationality, and Interaction 7th International Workshop, LORI 2019, Chongqing, China, October 18–21, 2019, Proceedings. Springer. pp. 153-167.
    Weakly Aggregative Modal Logic (WAML) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. WAML has some interesting applications on epistemic logic and logic of games, so we study some basic model theoretical aspects of WAML in this paper. Specifically, we give a van Benthem-Rosen characterization theorem of WAML based on an intuitive notion of bisimulation and show that each basic WAML system Kn lacks Craig Interpolation.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  67
    Knowing Your Ability.Tszyuen Lau & Yanjing Wang - 2016 - Philosophical Forum 47 (3-4):415-423.
    In this article, we present an attempt to reconcile intellectualism and the anti-intellectualist ability account of knowledge-how by reducing “S knows how to F” to, roughly speaking, “S knows that she has the ability to F demonstrated by a concrete way w.” More precisely, “S has a certain ability” is further formalized as the proposition that S can guarantee a certain goal by a concrete way w of some method under some precondition. Having the knowledge of our own ability, we (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  22. To know or not to know: epistemic approaches to security protocol verification.Francien Dechesne & Yanjing Wang - 2010 - Synthese 177 (S1):51-76.
    Security properties naturally combine temporal aspects of protocols with aspects of knowledge of the agents. Since BAN-logic, there have been several initiatives and attempts to incorpórate epistemics into the analysis of security protocols. In this paper, we give an overview of work in the field and present it in a unified perspective, with comparisons on technical subtleties that have been employed in different approaches. Also, we study to which degree the use of epistemics is essential for the analysis of security (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  23.  40
    Neighborhood semantics for logic of knowing how.Yanjun Li & Yanjing Wang - 2021 - Synthese 199 (3-4):8611-8639.
    In this paper, we give an alternative semantics to the non-normal logic of knowing how proposed by Fervari et al., based on a class of Kripke neighborhood models with both the epistemic relations and neighborhood structures. This alternative semantics is inspired by the same quantifier alternation pattern of ∃∀\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\exists \forall $$\end{document} in the semantics of the know-how modality and the neighborhood semantics for the standard modality. We show that this new semantics (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  13
    Hypergraphs, Local Reasoning, and Weakly Aggregative Modal Logic.Yifeng Ding, Jixin Liu & Yanjing Wang - 2021 - In Sujata Ghosh & Thomas Icard (eds.), Logic, Rationality, and Interaction: 8th International Workshop, Lori 2021, Xi’an, China, October 16–18, 2021, Proceedings. Springer Verlag. pp. 58-72.
    This paper connects the following three apparently unrelated topics: an epistemic framework fighting logical omniscience, a class of generalized graphs without the arities of relations, and a family of non-normal modal logics rejecting the aggregative axiom. Through neighborhood frames as their meeting point, we show that, among many completeness results obtained in this paper, the limit of a family of weakly aggregative logics is both exactly the modal logic of hypergraphs and also the epistemic logic of local reasoning with veracity (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  62
    A New Framework for Epistemic Logic.Yanjing Wang - 2017 - In Proceedings of TARK 2017. EPTCS. pp. 515-534.
    Recent years witnessed a growing interest in non-standard epistemic logics of knowing whether, knowing how, knowing what, knowing why and so on. The new epistemic modalities introduced in those logics all share, in their semantics, the general schema of ∃x◻φ, e.g., knowing how to achieve φ roughly means that there exists a way such that you know that it is a way to ensure that φ. Moreover, the resulting logics are decidable. Inspired by those particular logics, in this work, we (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  26. Logic of Information Flow on Communi- cation Channels.Yanjing Wang & Jan van Eijck - unknown
    In this paper1, we develop an epistemic logic to specify and reason about the information flow on the underlying communication channels. By combining ideas from Dynamic Epistemic Logic (DEL) and Interpreted Systems (IS), our semantics offers a natural and neat way of modelling multi-agent communication scenarios with different assumptions about the observational power of agents. We relate our logic to the standard DEL and IS..
     
    Export citation  
     
    Bookmark   4 citations  
  27.  15
    Verifying epistemic protocols under common knowledge.Yanjing Wang, Lakshmanan Kuppusamy & Jan van Eijck - 2009 - Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge - Tark ’09:257--266.
    Epistemic protocols are communication protocols aiming at transfer of knowledge in a controlled way. Typically, the preconditions or goals for protocol actions depend on the knowledge of agents, often in nested form. Informal epistemic protocol descriptions for muddy children, coordinated attack, dining cryptographers, Russian cards, secret key exchange are well known. The contribution of this paper is a formal study of a natural requirement on epistemic protocols, that the contents of the protocol can be assumed to be common knowledge. By (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  28. Composing models.Jan van Eijck & Yanjing Wang - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):397-425.
    • We study a new composition operation on (epistemic) multiagent models and update actions that takes vocabulary extensions into account.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  29.  49
    Someone knows that local reasoning on hypergraphs is a weakly aggregative modal logic.Yifeng Ding, Jixin Liu & Yanjing Wang - 2023 - Synthese 201 (2):1-27.
    This paper connects the following four topics: a class of generalized graphs whose relations do not have fixed arities called hypergraphs, a family of non-normal modal logics rejecting the aggregative axiom, an epistemic framework fighting logical omniscience, and the classical group knowledge modality of ‘someone knows’. Through neighborhood frames as their meeting point, we show that, among many completeness results obtained in this paper, the limit of a family of weakly aggregative logics is both exactly the modal logic of hypergraphs (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  16
    (1 other version)Not All Those Who Wander Are Lost: Dynamic Epistemic Reasoning in Navigation.Yanjing Wang & Yanjun Li - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 559-580.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  31.  5
    Knowing how to plan about planning: Higher-order and meta-level epistemic planning.Yanjun Li & Yanjing Wang - 2024 - Artificial Intelligence 337 (C):104233.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32.  41
    Model Theoretical Aspects of Weakly Aggregative Modal Logic.Jixin Liu, Yifeng Ding & Yanjing Wang - 2022 - Journal of Logic, Language and Information 31 (2):261-286.
    Weakly Aggregative Modal Logic ) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. \ has interesting applications on epistemic logic, deontic logic, and the logic of belief. In this paper, we study some basic model theoretical aspects of \. Specifically, we first give a van Benthem–Rosen characterization theorem of \ based on an intuitive notion of bisimulation. Then, in contrast to many well known normal or non-normal modal logics, we show that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  33. More for free: A dynamic epistemic framework for conformant planning over transition systems.Yanjun Li, Quan Yu & Yanjing Wang - 2017 - Journal of Logic and Computation 27 (8):2383--2410.
    © The Author, 2017. Published by Oxford University Press. All rights reserved. In this article, we introduce a lightweight dynamic epistemic logical framework for automated planning under initial uncertainty. We generalize the standard conformant planning problem in AI in two crucial aspects: first, the planning goal can be any formula expressed in an epistemic propositional dynamic logic ; second, procedural constraints of the desired plan specified by regular expressions can be imposed. We then reduce the problem of generalized conformant planning (...)
    No categories
     
    Export citation  
     
    Bookmark  
  34. (1 other version)Beyond knowing that: a new generation of epistemic logics.Yanjing Wang - 2018 - In Hans van Ditmarsch & Gabriel Sandu (eds.), Jaakko Hintikka on Knowledge and Game Theoretical Semantics. Cham, Switzerland: Springer.
    No categories
     
    Export citation  
     
    Bookmark  
  35. Proceedings of TARK 2017.Yanjing Wang (ed.) - 2017 - EPTCS.
    No categories
     
    Export citation  
     
    Bookmark