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



Nalon, Claudia, Hustadt, Ullrich ORCID: 0000-0002-0455-0267 and Dixon, CL ORCID: 0000-0002-4610-9533
(2020) A Resolution-Based Theorem Prover for Kn: Architecture, Refinements, Strategies and Experiments. Journal of Automated Reasoning, 64 (3). 461 - 484.

This is the latest version of this item.

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

Download (537kB)
[img] Text
Nalon2018_Article_AResolution-BasedTheoremProver.pdf - OA Published Version

Download (1MB)

Abstract

In this paper we describe the implementation of , 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: 11 Jun 2022 04:11
DOI: 10.1007/s10817-018-09503-x
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3031374

Available Versions of this Item