Temporal resolution using a breadth-first search algorithm

Annals of Mathematics and Artificial Intelligence

Volumn 22, Issue 1-2, 1998, Pages 87-115

  Dixon, Clare ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032362014     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018942108420     Document Type: Article

References (46)

1. M. Abadi, Temporal-logic theorem proving, Ph.D. thesis, Department of Computer Science, Stanford University (1987).
2. M. Abadi and Z. Manna, Nonclausal deduction in first-order temporal logic, Journal of ACM 37(2) (1990) 279-317.
3. H. Barringer, Using temporal logic in the compositional specification of concurrent systems, in: Temporal Logics and their Applications, ed. A.P. Galton, Chapter 2 (Academic Press, London, 1987) pp. 53-90.
4. H. Barringer, M. Fisher, D. Gabbay, R. Owens and M. Reynolds, eds., The Imperative Future (Research Studies Press, 1996).
5. H. Barringer, R. Kuiper and A. Pnueli, Now you may compose temporal logic specifications, in: Proc. Sixteenth ACM Symp. Theory of Computing (1984).
6. N. Bjorner, A. Browne, E. Chang, M. Colon, A. Kapur, Z. Manna, H.B. Sipma and T.E. Uribe, STeP The Stanford Temporal Prover Educational Release Version 1.0 User's Manual, Computer Science Department, Stanford University, CA (1995).
7. A. Bolotov and M. Fisher, A resolution method for CTL branching-time temporal logic, in: Proc. TIME '97 the Fourth International Workshop on Temporal Representation and Reasoning, Daytona Beach, FL (IEEE Computer Society Press, 1997).
8. M. Carlsson and J. Widen, SICStus Prolog User's Manual, Swedish Institute of Computer Science, Kista, Sweden (1991).
9. A. Cavalli and L. Fariñas del Cerro, A decision method for linear temporal logic, in: Proc. 7th International Conference on Automated Deduction (CADE), ed. R.E. Shostak, Lecture Notes in Computer Science 170 (Springer, 1984) pp. 113-127.
10. C.L. Chang and R.C.T. Lee, Symbolic Logic and Mechanical Theorem Proving (Academic Press, 1973).
11. C. Dixon, Strategies for temporal resolution, Ph.D. thesis, Department of Computer Science, University of Manchester (1995).
12. C. Dixon, Search strategies for resolution in temporal logics, in: Proc. Thirteenth International Conference on Automated Deduction (CADE), New Brunswick, NJ, eds. M.A. McRobbie and J.K. Slaney, Lecture Notes in Artificial Intelligence 1104 (Springer, 1996) pp. 672-687.
13. C. Dixon, Temporal resolution: removing irrelevant information, in: Proc. TIME '97 the Fourth International Workshop on Temporal Representation and Reasoning, Daytona Beach, FL (IEEE Computer Society Press, 1997).
14. R. Fagin, J.Y. Halpern, Y. Moses and M.Y. Vardi, Reasoning About Knowledge (MIT Press, 1995).
15. M. Fisher, A resolution method for temporal logic, in: Proc. Twelfth International Joint Conference on Artificial Intelligence (IJCAI), Sydney, Australia (Morgan Kaufmann, 1991).
16. M. Fisher, A normal form for first-order temporal formulae, in: Proc. Eleventh International Conference on Automated Deduction (CADE), Saratoga Springs, NY, Lecture Notes in Computer Science 607 (Springer, 1992).
17. M. Fisher and P. Noël, Transformation and synthesis in METATEM - Part I: Prepositional METATEM. Technical Report UMCS-92-2-1, Department of Computer Science, University of Manchester, Manchester, UK (1992).
18. M. Fisher and R. Owens, eds., Executable Modal and Temporal Logics, Lecture Notes in Artificial Intelligence 897 (Springer, 1995).
19. M. Fisher and M. Wooldridge, On the formal specification and verification of multi-agent systems, International Journal of Cooperative Information Systems 6(1) (1997).
20. M. Fisher, M. Wooldridge and C. Dixon, A resolution-based proof method for temporal logics of knowledge and belief, in: Proc. International Conference on Formal and Applied Practical Reasoning (FAPR '96), Bonn, Germany (1996).
21. D. Gabbay, A. Pnueli, S. Shelah and J. Stavi, The temporal analysis of fairness, in: Proc. Seventh ACM Symp. Principles of Programming Languages, Las Vegas, NE (1980) pp. 163-173.
22. G.D. Gough, Decision procedures for temporal logic, Master's thesis, Department of Computer Science, University of Manchester, October 1984. Also University of Manchester, Department of Computer Science, Technical Report UMCS-89-10-1.
23. B.T. Hailpern, Verifying Concurrent Processes Using Temporal Logic, Lecture Notes in Computer Science 129 (Springer, 1982).
24. J.Y. Halpern, Using reasoning about knowledge to analyze distributed systems, Annual Review of Computer Science 2 (1987).
25. G. Jaeger, A. Heuerding, S. Schwendimann, F. Achermann, P. Balsiger, P. Brambilla, H. Zimmermann, M. Bianchi, K. Guggisberg and W. Heinle, LWB - The Logics Workbench 1.0, University of Berne, Switzerland, http://lwbwww.unibe.ch:8080/LWBinfo.html.
26. J.A.W. Kamp, Tense logic and the theory of linear order, Ph.D. thesis, University of California (1968).
27. R. Kowalski, Predicate logic as a programming language, in: Proc. International Federation for Information Processing, ed. J.L. Rosenfield (North-Holland, 1974) pp. 569-574.
28. R. Kowalski, Logic for Problem Solving (North-Holland, 1979).
29. L. Lamport, Specifying concurrent program modules, ACM Transactions on Programming Languages and Systems 5(2) (1983) 190-222.
30. Z. Manna and A. Pnueli, Verification of concurrent programs: The temporal framework, in: The Correctness Problem in Computer Science, eds. R.S. Boyer and J.S. Moore (Academic Press, London, 1981) pp. 215-273.
31. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification (Springer, New York, 1992).
32. Z. Manna and A. Pnueli, Temporal Verification of Reactive Systems: Safety (Springer, New York, 1995).
33. W.W. McCune, OTTER 2.0 Users Guide, ANL-90/9, Argonne National Laboratory, Argonne, IL (1990).
34. B. Moszkowski, Reasoning about digital circuits, Ph.D. thesis, Department of Computer Science, Stanford University (1983).
35. S. Owicki and L. Lamport, Proving liveness properties of concurrent programs, ACM Transactions on Programming Languages and Systems 4(3) (1982) 455-495.
36. M. Peim, Propositional temporal resolution over labelled transition systems, Unpublished Technical Note, Department of Computer Science, University of Manchester (1994).
37. G.L. Peterson, Myths about the mutual exclusion problem, Information Processing Letters 12(3) (1981) 115-116.
38. A. Pnueli, The temporal logic of programs, in: Proc. Eighteenth Symp. Foundations of Computer Science, Providence (1977).
39. A. Pnueli, The temporal semantics of concurrent programs, Theoretical Computer Science 13 (1981) 45-60.
40. A. Pnueli, In transition from global to modular temporal reasoning about programs, in: Logics and Models of Concurrent Systems, ed. K. Apt, La Colle-sur-Loup, France (NATO, Springer, 1984) pp. 123-144.
41. A. Pnueli, Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends, in: Current Trends in Concurrency, eds. J.W. de Bakker, W.P. de Roever and G. Rozenberg, Lecture Notes in Computer Science 224 (Springer, 1986).
42. E. Rich and K. Knight, Artificial Intelligence (McGraw-Hill, 1991).
43. J.A. Robinson, A machine-oriented logic based on the resolution principle, Journal of ACM 12(1) (1965) 23-41.
44. M. Y. Vardi and P. Wolper, An automata-theoretic approach to automatic program verification, in: Proc. IEEE Symp. Logic in Computer Science, Cambridge (1986) pp. 332-344.
45. G. Venkatesh, A decision method for temporal logic based on resolution, Lecture Notes in Computer Science 206 (1986) pp. 272-289.
46. P. Wolper, The tableau method for temporal logic: An overview, Logique et Analyse 110-111 (1985) 119-136.