Switch to: References

Add citations

You must login to add citations.
  1. Reasoning about Dependence, Preference and Coalitional Power.Qian Chen, Chenwei Shi & Yiyan Wang - 2024 - Journal of Philosophical Logic 53 (1):99-130.
    This paper presents a logic of preference and functional dependence (LPFD) and its hybrid extension (HLPFD), both of whose sound and strongly complete axiomatization are provided. The decidability of LPFD is also proved. The application of LPFD and HLPFD to modelling cooperative games in strategic form is explored. The resulted framework provides a unified view on Nash equilibrium, Pareto optimality and the core. The philosophical relevance of these game-theoretical notions to discussions of collective agency is made explicit. Some key connections (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Data-informed knowledge and strategies.Junli Jiang & Pavel Naumov - 2022 - Artificial Intelligence 309 (C):103727.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Dynamic Logic of Data-Informed Knowledge.Kaya Deuser, Junli Jiang, Pavel Naumov & Wenxuan Zhang - 2024 - Journal of Philosophical Logic 53 (2):521-557.
    With agents relying more and more on information from central servers rather than their own sensors, knowledge becomes property not of a specific agent but of the data that the agents can access. The article proposes a dynamic logic of data-informed knowledge that describes an interplay between three modalities and one relation capturing the properties of this form of knowledge. The main technical results are the undefinability of two dynamic operators through each other, a sound and complete axiomatisation, and a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A Simple Logic of the Hide and Seek Game.Dazhu Li, Sujata Ghosh, Fenrong Liu & Yaxin Tu - 2023 - Studia Logica 111 (5):821-853.
    We discuss a simple logic to describe one of our favourite games from childhood, hide and seek, and show how a simple addition of an equality constant to describe the winning condition of the seeker makes our logic undecidable. There are certain decidable fragments of first-order logic which behave in a similar fashion with respect to such a language extension, and we add a new modal variant to that class. We discuss the relative expressive power of the proposed logic in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Complete Logics for Elementary Team Properties.Juha Kontinen & Fan Yang - forthcoming - Journal of Symbolic Logic:1-41.
    In this paper, we introduce a logic based on team semantics, called $\mathbf {FOT} $, whose expressive power is elementary, i.e., coincides with first-order logic both on the level of sentences and (possibly open) formulas, and we also show that a sublogic of $\mathbf {FOT} $, called $\mathbf {FOT}^{\downarrow } $, captures exactly downward closed elementary (or first-order) team properties. We axiomatize completely the logic $\mathbf {FOT} $, and also extend the known partial axiomatization of dependence logic to dependence logic (...)
    Download  
     
    Export citation  
     
    Bookmark