Abstract
The effective mechanisation of temporal logic is vital to the application of temporal reasoning in many fields, for example the verification of reactive systems, the implementation of temporal query languages, and temporal logic programming. Consequently, a variety of proof methods have been developed, implemented and applied. While clausal temporal resolution has been successfully employed for a range of problems, a number of improvements are still required. One particular drawback for certain applications is the restriction that temporal resolution operations must occur only after all relevant non-temporal resolution steps have been carried out. It is this restriction that we consider in this paper, where we introduce, justify and apply a new temporal resolution rule. This rule, which may be seen as a generalisation of the existing temporal resolution rule, can be applied at any time during the refutation, thus providing the possibility for much greater interleaving between temporal and non-temporal operations. In addition, the use of this temporal resolution rule can provide information that is useful in guiding any subsequent search.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8: 277–295, 1989.
M. Abadi and Z. Manna. Nonclausal Deduction in First-Order Temporal Logic. ACM Journal, 37 (2): 279–317, April 1990.
A. Cavali and L. Farinas del Cerro. A Decision Method for Linear Temporal Logic. In R. E. Shostak, editor, Proceedings of the 7th International Conference on Automated Deduction, pages 113–127. LNCS 170, 1984.
J. Chomicki and D. Niwinski. On the Feasibility of Checking Temporal Integrity Constraints. Journal of Computer and System Sciences, 51 (3): 523–535, December 1995.
C. Dixon. Strategies for Temporal Resolution. PhD thesis, Department of Computer Science, University of Manchester, Manchester M13 9PL, U.K., December 1995.
C. Dixon. Search Strategies for Resolution in Temporal Logics. In Proceedings of the Thirteenth International Conference on Automated Deduction (CADE), Lecture Notes in Computer Science. Springer-Verlag, August 1996.
C. Dixon. Temporal Resolution: Removing Irrelevant Information. In Proceedings of International Workshop on Temporal Reasoning (TIME), Daytona Beach, Florida, May 1997.
M. Fisher. A Resolution Method for Temporal Logic. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI), Sydney, Australia, August 1991. Morgan Kaufman.
M. Fisher. A Normal Form for Temporal Logic and its Application in Theorem-Proving and Execution. Journal of Logic and Computation, 7 (4), August 1997.
D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. The Temporal Analysis of Fairness. In Proceedings of the Seventh ACM Symposium on the Principles of Programming Languages, pages 163–173, Las Vegas, Nevada, January 1980.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1992.
M. Peim. Propositional Temporal Resolution Over Labelled Transition Systems. Unpublished Technical Note, Department of Computer Science, University of Manchester, 1994.
G. L. Peterson. Myths about the Mutual Exclusion Problem. Information Processing Letters, 12 (3): 115–116, 1981.
D. A. Plaisted and S. A. Greenbaum. A Structure-Preserving Clause Form Translation. Journal of Symbolic Computation, 2 (3): 293–304, September 1986.
A. Pnueli. In Transition from Global to Modular Temporal Reasoning about Programs. In Advanced Institute on Logics and Models for Verification and Specification of Concurrent Systems,La Colle Sur Loupe, October 1984. Springer-Verlag.
A. P. Sistla, M. Vardi, and P. Wolper. The Complementation Problem for Büchi Automata with Applications to Temporal Logic. Theoretical Computer Science, 49: 217–237, 1987.
G. Venkatesh. A Decision Method for Temporal Logic based on Resolution. Lecture Notes in Computer Science, 206: 272–289, 1986.
P. Wolper. The Tableau Method for Temporal Logic: An overview. Logique et Analyse, 110–111:119–136, June-Sept 1985.
L. Wos, G. Robinson, and D. Carson. Efficiency and Completeness of the Set of Support Strategy in Theorem Proving. ACM Journal, 12: 536–541, October 1965.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Fisher, M., Dixon, C. (2000). Guiding Clausal Temporal Resolution. In: Barringer, H., Fisher, M., Gabbay, D., Gough, G. (eds) Advances in Temporal Logic. Applied Logic Series, vol 16. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9586-5_9
Download citation
DOI: https://doi.org/10.1007/978-94-015-9586-5_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5389-3
Online ISBN: 978-94-015-9586-5
eBook Packages: Springer Book Archive