The University of Southampton
University of Southampton Institutional Repository

Resolution Theorem Proving in Reified Model Logics

Resolution Theorem Proving in Reified Model Logics
Resolution Theorem Proving in Reified Model Logics
This paper is concerned with the application of the resolution theorem proving method to reified logics. The logical systems treated include the branching temporal logics and logics of belief based on K and its extensions. Two important problems concerning the application of the resolution rule to reified systems are identified. The first is the redundancy in the representation of truth functional relationships and the second is the axiomatic reasoning about modal structure. Both cause an unnecessary expansion in the search space. We present solutions to both problems which allow the axioms defining the reified logic to be eliminated from the database during theorem proving hence reducing the search space while retaining completeness. We describe three theorem proving methods which embody our solutions and support our analysis with empirical results.
103-129
Aitken, J.
1c1ebda8-93a0-4f89-9bf0-3a98f5d3ea59
Reichgelt, H.
563d1f9c-a2ec-4e94-b513-12884d1a6393
Shadbolt, N. R.
5c5acdf4-ad42-49b6-81fe-e9db58c2caf7
Aitken, J.
1c1ebda8-93a0-4f89-9bf0-3a98f5d3ea59
Reichgelt, H.
563d1f9c-a2ec-4e94-b513-12884d1a6393
Shadbolt, N. R.
5c5acdf4-ad42-49b6-81fe-e9db58c2caf7

Aitken, J., Reichgelt, H. and Shadbolt, N. R. (1994) Resolution Theorem Proving in Reified Model Logics. Journal of Automated Reasoning, 12, 103-129.

Record type: Article

Abstract

This paper is concerned with the application of the resolution theorem proving method to reified logics. The logical systems treated include the branching temporal logics and logics of belief based on K and its extensions. Two important problems concerning the application of the resolution rule to reified systems are identified. The first is the redundancy in the representation of truth functional relationships and the second is the axiomatic reasoning about modal structure. Both cause an unnecessary expansion in the search space. We present solutions to both problems which allow the axioms defining the reified logic to be eliminated from the database during theorem proving hence reducing the search space while retaining completeness. We describe three theorem proving methods which embody our solutions and support our analysis with empirical results.

Text
3_Multi_Modal_Res_Th_Proving_94_JAR.pdf - Accepted Manuscript
Download (4MB)

More information

Published date: 1994
Organisations: Web & Internet Science

Identifiers

Local EPrints ID: 252303
URI: http://eprints.soton.ac.uk/id/eprint/252303
PURE UUID: 9a0355e5-682f-4b84-b5ad-fd9f060b2cc5

Catalogue record

Date deposited: 20 Jan 2000
Last modified: 14 Mar 2024 05:18

Export record

Contributors

Author: J. Aitken
Author: H. Reichgelt
Author: N. R. Shadbolt

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×