Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)A Note on Graded Modal Logic.Maarten De Rijke - 2000 - Studia Logica 64 (2):271 - 283.
    We introduce a notion of bisimulation for graded modal logic. Using this notion, the model theory of graded modal logic can be developed in a uniform manner. We illustrate this by establishing the finite model property and proving invariance and definability results.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A History Based Logic for Dynamic Preference Updates.Can Başkent & Guy McCusker - 2020 - Journal of Logic, Language and Information 29 (3):275-305.
    History based models suggest a process-based approach to epistemic and temporal reasoning. In this work, we introduce preferences to history based models. Motivated by game theoretical observations, we discuss how preferences can dynamically be updated in history based models. Following, we consider arrow update logic and event calculus, and give history based models for these logics. This allows us to relate dynamic logics of history based models to a broader framework.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)A note on graded modal logic.Maarten de Rijke - 2000 - Studia Logica 64 (2):271-283.
    We introduce a notion of bisimulation for graded modal logic. Using this notion, the model theory of graded modal logic can be developed in a uniform manner. We illustrate this by establishing the finite model property and proving invariance and definability results.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The true bisimulations for 'since' and 'until'.Holger Sturm - 2002 - Logic and Logical Philosophy 10:173.
    The aim of this paper is to establish a new notion of equivalencebetween temporal models, so-called S-similarity, as the appropriate notionof bisimilarity for temporal logic with Since and Until. The main technicalresults of the paper provide semantical characterizations of the first-orderformulas that are equivalent to a temporal formula: Theorem 3.7 concernsthe equivalence of temporal and first-order formulas with respect to pointedtemporal models, whereas Theorem 4.4 takes the level of temporal modelsinto account.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Extensive games as process models.Johan van Benthem - 2002 - Journal of Logic, Language and Information 11 (3):289-313.
    We analyze extensive games as interactive process models, using modallanguages plus matching notions of bisimulation as varieties of gameequivalences. Our technical results show how to fit existing modalnotions into this new setting.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • A ModalWalk Through Space.Marco Aiello & Johan van Benthem - 2002 - Journal of Applied Non-Classical Logics 12 (3-4):319-363.
    We investigate the major mathematical theories of space from a modal standpoint: topology, affine geometry, metric geometry, and vector algebra. This allows us to see new fine-structure in spatial patterns which suggests analogies across these mathematical theories in terms of modal, temporal, and conditional logics. Throughout the modal walk through space, expressive power is analyzed in terms of language design, bisimulations, and correspondence phenomena. The result is both unification across the areas visited, and the uncovering of interesting new questions.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Modal logic: A semantic perspective.Patrick Blackburn & Johan van Benthem - 1988 - Ethics 98:501-517.
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2 BASIC MODAL LOGIC . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Expressiveness of concept expressions in first-order description logics.Natasha Kurtonina & Maarten de Rijke - 1999 - Artificial Intelligence 107 (2):303-333.
    Download  
     
    Export citation  
     
    Bookmark   1 citation