Proof Theory and Decision Procedures for Deontic STIT Logics

Tim LyonTim Lyon, Kees van BerkelKees van Berkel

Tim Lyon, Kees van Berkel
Proof Theory and Decision Procedures for Deontic STIT Logics
Journal of Artificial Intelligence Research, to appear

Details
Bibtex

KurzfassungAbstract
This paper addresses the automation of reasoning with deontic STIT logics by means of proof theory. Our methodology consists of leveraging sound and cut-free complete sequent-style calculi to write a proof-search algorithm deciding deontic, multi-agent STIT logics with (un)limited choice. In order to ensure the termination of our proof-search algorithm, we introduce a special loop-checking mechanism. Despite the acknowledged potential for deontic reasoning in the context of autonomous vehicles and other areas of AI, this work is the first to provide a syntactic decision procedure for deontic STIT logics. Our proof-search procedure is designed to provide verifiable witnesses/certificates of the (in)validity of formulae, which permit an analysis of the (non)theoremhood of formulae and act as explanations thereof. We utilize our proof-search algorithm to address agent-based normative reasoning tasks such as compliance checking.
Weitere Informationen unter:Further Information: Link
Projekt:Project: DeciGUT
Forschungsgruppe:Research Group: Computational LogicComputational Logic

@article{LB2024,
  author  = {Tim Lyon and Kees van Berkel},
  title   = {Proof Theory and Decision Procedures for Deontic {STIT} Logics},
  journal = {Journal of Artificial Intelligence Research},
  year    = {2024}
}