KSP A Resolution-Based Theorem Prover for K_n : Architecture, Refinements, Strategies and Experiments



Nalon, C, Hustadt, U ORCID: 0000-0002-0455-0267 and Dixon, C ORCID: 0000-0002-4610-9533
(2020) KSP A Resolution-Based Theorem Prover for K_n : Architecture, Refinements, Strategies and Experiments. Journal of Automated Reasoning, 64. 461 - 484.

[img] Text
jar-2017.pdf - Accepted Version

Download (537kB)

Abstract

In this paper we describe the implementation of KSP, a resolution-based prover for the basic multimodal logic Kn. The prover implements a resolution-based calculus for both local and global reasoning. The user can choose different normal forms, refinements of the basic resolution calculus, and strategies. We describe these options in detail and discuss their implications. We provide experiments comparing some of these options and comparing the prover with other provers for this logic.

Item Type: Article
Uncontrolled Keywords: Modal logics, Theorem proving, Resolution method
Depositing User: Symplectic Admin
Date Deposited: 16 Jan 2019 10:55
Last Modified: 13 Jul 2022 12:17
DOI: 10.1007/s10817-018-09503-x
Open Access URL: https://link.springer.com/article/10.1007/s10817-0...
URI: https://livrepository.liverpool.ac.uk/id/eprint/3031352