Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Temporal resolution using a breadth-first search algorithm

Temporal resolution using a breadth-first search algorithm An approach to applying clausal resolution, a proof method well suited to mechanisation, to temporal logics has been developed by Fisher. The method involves translation to a normal form, classical style resolution within states, and temporal resolution between states. Not only has it been shown to be correct but as it consists of only one temporal resolution rule, it is particularly suitable as the basis of an automated temporal resolution theorem prover. As the application of the temporal resolution rule is the most costly part of the method, it is on this area that we focus. Detailed algorithms for abreadth‐first search approach to the application of this rule are presented. Correctness is shown and complexity given. Analysis of the behaviour of the algorithms is carried out and we explain why this approach is an improvement to others suggested. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Temporal resolution using a breadth-first search algorithm

Download PDF
29 pages

Loading next page...
 
/lp/springer-journals/temporal-resolution-using-a-breadth-first-search-algorithm-KX2kpxN40b

References (48)

Publisher
Springer Journals
Copyright
Copyright © 1998 by Kluwer Academic Publishers
Subject
Computer Science; Computer Science, general; Artificial Intelligence (incl. Robotics); Mathematics, general; Complexity
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1023/A:1018942108420
Publisher site
See Article on Publisher Site

Abstract

An approach to applying clausal resolution, a proof method well suited to mechanisation, to temporal logics has been developed by Fisher. The method involves translation to a normal form, classical style resolution within states, and temporal resolution between states. Not only has it been shown to be correct but as it consists of only one temporal resolution rule, it is particularly suitable as the basis of an automated temporal resolution theorem prover. As the application of the temporal resolution rule is the most costly part of the method, it is on this area that we focus. Detailed algorithms for abreadth‐first search approach to the application of this rule are presented. Correctness is shown and complexity given. Analysis of the behaviour of the algorithms is carried out and we explain why this approach is an improvement to others suggested.

Journal

Annals of Mathematics and Artificial Intelligence – Springer Journals

Published: Sep 17, 2004

There are no references for this article.