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 r...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
1994.
|
| Subjects: | |
| Online Access: | Get fulltext |
| LEADER | 01276 am a22001453u 4500 | ||
|---|---|---|---|
| 001 | 252303 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Aitken, J. |e author |
| 700 | 1 | 0 | |a Reichgelt, H. |e author |
| 700 | 1 | 0 | |a Shadbolt, N. R. |e author |
| 245 | 0 | 0 | |a Resolution Theorem Proving in Reified Model Logics |
| 260 | |c 1994. | ||
| 856 | |z Get fulltext |u https://eprints.soton.ac.uk/252303/1/3_Multi_Modal_Res_Th_Proving_94_JAR.pdf | ||
| 520 | |a 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. | ||
| 655 | 7 | |a Article | |