Switch to: References

Citations of:

Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics

In M. Baldoni, M. Dastani, B. Liao, Y. Sakurai & R. Zalila Wenkstern (eds.), PRIMA 2019: Principles and Practice of Multi-Agent Systems. Springer. pp. 202-218 (2019)

Add citations

You must login to add citations.
  1. Alternative Axiomatization for Logics of Agency in a G3 Calculus.Sara Negri & Edi Pavlović - 2021 - Foundations of Science 28 (1):205-224.
    In a recent paper, Negri and Pavlović (Studia Logica 1–35, 2020) have formulated a decidable sequent calculus for the logic of agency, specifically for a deliberative see-to-it-that modality, or dstit. In that paper the adequacy of the system is demonstrated by showing the derivability of the axiomatization of dstit from Belnap et al. (Facing the future: agents and choices in our indeterminist world. Oxford University Press, Oxford, 2001). And while the influence of the latter book on the study of logics (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Uniform and Modular Sequent Systems for Description Logics.Tim Lyon & Jonas Karge - 2022 - In Ofer Arieli, Martin Homola, Jean Christoph Jung & Marie-Laure Mugnier (eds.), Proceedings of the 35th International Workshop on Description Logics (DL 2022).
    We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be obtained for extensions of description logics with special formulae that we call "role relational axioms." All sequent systems are sound, complete, and possess favorable properties such as height-preserving admissibility of common structural rules and height-preserving invertibility of rules.
    Download  
     
    Export citation  
     
    Bookmark  
  • Display to Labeled Proofs and Back Again for Tense Logics.Agata Ciabattoni, Tim Lyon, Revantha Ramanayake & Alwen Tiu - 2021 - ACM Transactions on Computational Logic 22 (3):1-31.
    We introduce translations between display calculus proofs and labeled calculus proofs in the context of tense logics. First, we show that every derivation in the display calculus for the minimal tense logic Kt extended with general path axioms can be effectively transformed into a derivation in the corresponding labeled calculus. Concerning the converse translation, we show that for Kt extended with path axioms, every derivation in the corresponding labeled calculus can be put into a special form that is translatable to (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Varieties of Ought-implies-Can and Deontic STIT Logic.Kees van Berkel & Tim Lyon - 2021 - In Fenrong Liu, Alessandra Marra, Paul Portner & Frederik Van De Putte (eds.), Deontic Logic and Normative Systems: 15th International Conference.
    STIT logic is a prominent framework for the analysis of multi-agent choice-making. In the available deontic extensions of STIT, the principle of Ought-implies-Can (OiC) fulfills a central role. However, in the philosophical literature a variety of alternative OiC interpretations have been proposed and discussed. This paper provides a modular framework for deontic STIT that accounts for a multitude of OiC readings. In particular, we discuss, compare, and formalize ten such readings. We provide sound and complete sequent-style calculi for all of (...)
    Download  
     
    Export citation  
     
    Bookmark