Home > Research > Publications & Outputs > Local is Best: Efficient Reductions to Modal Lo...

Links

Text available via DOI:

View graph of relations

Local is Best: Efficient Reductions to Modal Logic K

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
Close
Article number4
<mark>Journal publication date</mark>23/05/2022
<mark>Journal</mark>Journal of Automated Reasoning
Issue number4
Volume66
Number of pages28
Pages (from-to)639-666
Publication StatusPublished
<mark>Original language</mark>English

Abstract

We present novel reductions of extensions of the basic modal logic K with axioms B, D, T, 4 and 5 to Separated Normal Form with Sets of Modal Levels SNFsml. The reductions typically result in smaller formulae than the reductions by Kracht. The reductions to SNFsml combined with a reduction to SNFml allow us to use the local reasoning of the prover KSP to determine the satisfiability of modal formulae in the considered logics. We show experimentally that the combination of our reductions with the prover KSP performs well when compared with a specialised resolution calculus for these logics, the built-in reductions of the first-order prover SPASS, and the higher-order logic prover LEO-III.