Resolution Theorem Proving in Reified Model Logics

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


PDF - Accepted Manuscript
Download (4059Kb)


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.

Item Type: Article
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 252303
Accepted Date and Publication Date:
Date Deposited: 20 Jan 2000
Last Modified: 31 Mar 2016 13:53
Further Information:Google Scholar

Actions (login required)

View Item View Item

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