Temporal resolution: A breadth-first search approach

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn , Issue , 1996, Pages 120-127

  Dixon, C ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BREADTH-FIRST SEARCH; CLASSICAL LOGIC; CLAUSAL RESOLUTIONS; DEPTH FIRST; MECHANISATION; PROOF METHODS; TEMPORAL RESOLUTION; THEOREM PROVERS;

MACHINERY;

EID: 84957608906     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.1996.555690     Document Type: Conference Paper

References (25)

1. M. Abadi and Z. Manna. Nonclausal Deduction in First-Order Temporal Logic. ACM Journul, 37(2):279-317, April 1990.
2. H. Barringer. Using Temporal Logic in the Compositional Specification of Concurrent Systems. In A. P. Galton, editor, Temporal Logzcs and thezr Applications, chapter 2, pages 53-90. Academic Press Inc. Limited, London, December 1987.
3. H. Barringer, R. Kuiper, and A. Pnueli. Now You May Compose Temporal Logic Specifications. In Proceedzngs of the Saxteenth ACM Symposaum on the Theory of Computzng, 1984.
4. M. Carlsson and J. Widen. SICStus Prolog Users Manual. Swedish Institute of Computer Science, Kista, Sweden, September 1991.
5. A. Cavalli and L. Fariiias del Cerro. A Decision Method for Linear Temporal Logic. In R. E. Shostak, editor, Proceedings of the 7th International Conference on Automated Deduction, volume 170 of Lecture Notes in Computer Science, pages 113-127. Springer-Verlag, 1984.
6. C. L. Chang and R. C. T. Lee. Symbolic Logic and Mech, onical Theorem Proving. Academic Press, 1973.
7. C. Dixon. Strate, gies for Temporal Resolution. PhD thesis, Department of Computer Science, University of Manchester, 1995.
8. C. Dixon, M. Fisher, and H. Barringer. A Graph-Based Approach to Resolution in Temporal Logic. In D. M. Gabbay and H. J. Ohlbach, editors, Tem, poral Logic, First International Conference, ICTL '94, Proceedings, volume 827 of Lecture Notes in Artificial Jntelligen, ce, Bonn, Germany, July 1994. Springer-Verlag.
9. M. Fisher. A Resolution Method for Temporal Logic. In Proceedings of th, e Twelfth International Joint Conference on, Artificial Intelligence (IJCAI), Sydney, Australia, August 1991. Morgan Kaufman.
10. M. Fisher. A Normal Form for First-Order Temporal Formulae. In Proceedings of Eleventh Internmtional Con, ference on Automated Deduction (CADE), volume 607 of Lecture Notes in Computer Science, Saratoga Springs, New York, June 1992. S pringer-Verlag .
11. B. T. Hailpern. Verifying Concurrent Processes Using Temporal Logic, volume 129 of Lecture Notes in Computer Science. Springer-Verlag, 1982.
12. W. Hussak. Decidability in Temporal Presburger Arithmetic. Master's thesis, Department of Computer Science, University of Manchester, February 1987.
13. Z. Manna and A. Pnueli. Verification of Concurrent Programs: The Temporal Framework. In Robert S. Boyer and J. Strother Moore, editors, The Correctness Problem in Computer Science, pages 215-273. Academic Press, London, 1981.
14. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1992.
15. S. Owicki and L. Lamport. Proving Liveness Properties of Concurrent Programs. ACM Transactions on Programming Languages and Systems, 4(3):455-495, July 1982.
16. M. Peim. Propositional Temporal Resolution Over Labelled Transition Systems. Unpublished Technical Note, Department of Computer Science, University of Manchester, 1994.
17. G. L. Peterson. Myths about the Mutual Exclusion Problem. Informataon Processing Letters, 12 (3) : 115-1 16, 198 1.
18. A. Pnueli. The Temporal Logic of Programs. In Proceedings of the Eighteenth Symposium on the Foundations of Computer Science, Providence, November 1977.
19. A. Pnueli. The Temporal Semantics of Concurrent Programs. Theoretrcal Computer Science, 13~45-60, 1981.
20. A. Pnueli. In Transition From Global to Modular Temporal Reasoning about Programs. In Krysztof Apt, editor, Logzcs and Models of Concurrent Systems, pages 123-144, La Colle-sur-Loup, France, October 1984. NATO, Springer-Verlag.
21. A. Pnueli. Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends. In J.W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Cum-ent Trends an Concurrency, volume 224 of Lecture Notes zn Computer Science. Springer-Verlag, August 1986.
22. J. A. Robinson. A Machine-Oriented Logic Based on the Resolution Principle. ACM Journal, 12(1):23-41, January 1965.
23. M. Y. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In Proceedings IEEE Symposaum on Logzc zn Cormputer Sczence, pages 332-344, Cambridge, 1986.
24. G. Venlatesh. A Decision Method for Temporal Logic based on Resolution. Lecture Notes zn Computer Science, 206:272-289, 1986.
25. P. Wolper. The Tableau Method for Temporal Logic: An overview. Logzque et Analyse, 110-11 1: 119-136, June-Sept 1985.