Switch to: Citations

Add references

You must login to add references.
  1. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Bisimulations for Knowing How Logics.Raul Fervari, Fernando R. Velázquez-Quesada & Yanjing Wang - forthcoming - Review of Symbolic Logic:1-37.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • On the logic of cooperation and propositional control.Wiebe van der Hoek & Michael Wooldridge - 2005 - Artificial Intelligence 164 (1-2):81-119.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications.Wiebe van der Hoek & Michael Wooldridge - 2003 - Studia Logica 75 (1):125-157.
    Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as Alternating-time Temporal Logic (ATL). The key insight (...)
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • An epistemic logic of blameworthiness.Pavel Naumov & Jia Tao - 2020 - Artificial Intelligence 283 (C):103269.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Together we know how to achieve: An epistemic logic of know-how.Pavel Naumov & Jia Tao - 2018 - Artificial Intelligence 262 (C):279-300.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Cooperation, Knowledge, and Time: Alternating-Time Temporal Epistemic Logic and Its Applications.Wiebe van Der Hoek & Michael Wooldridge - 2003 - Studia Logica 75 (1):125-157.
    Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as "Alternating-time Temporal Logic". The key insight in (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • STS: A Structural Theory of Sets.Alexandru Baltag - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 1-34.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A Simple Logic of Functional Dependence.Alexandru Baltag & Johan van Benthem - 2021 - Journal of Philosophical Logic 50 (5):939-1005.
    This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations