Local Reductions for the Modal Cube⋆

Claudia Nalon, Ullrich Hustadt, Fabio Papacchini, Clare Dixon

Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

Abstract

The modal logic K is commonly used to represent and reason about necessity and possibility and its extensions with combinations of additional axioms are used to represent knowledge, belief, desires and intentions. Here we present local reductions of all propositional modal logics in the so-called modal cube, that is, extensions of K with arbitrary combinations of the axioms B, D, T, 4 and 5 to a normal form comprising a formula and the set of modal levels it occurs at. Using these reductions we can carry out reasoning for all these logics with the theorem prover KSP. We define benchmarks for these logics and experiment with the
reduction approach as compared to an existing resolution calculus with
specialised inference rules for the various logics.
Original languageEnglish
Title of host publicationAutomated Reasoning - 11th International Joint Conference, IJCAR 2022, Proceedings
EditorsJasmin Blanchette, Laura Kovács, Dirk Pattinson
Pages486-505
Number of pages20
DOIs
Publication statusPublished - 1 Aug 2022

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume13385
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Local Reductions for the Modal Cube⋆'. Together they form a unique fingerprint.

Cite this