Removing irrelevant information in temporal resolution proofs

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 11, Issue 1, 1999, Pages 95-121

  Dixon, Clare ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

Temporal theorem proving non classical resolution

Indexed keywords

EID: 0442329938     PISSN: 0952813X     EISSN: 13623079     Source Type: Journal    
DOI: 10.1080/095281399146634     Document Type: Article

References (39)

1. Abadi, M., and Manna, Z., 1990, Nonclausal deduction in first-order temporal logic. ACM Journal, 37(2): 279-317.
2. Barringer, H., 1987, Using temporal logic in the compositional specification of concurrent systems. Temporal Logics and their Applications, edited by A. P. Galton (London: Academic Press Inc. Limited), chapter 2, pp. 53-90.
3. Bjorner, N., Browne, A., Chang, E., Colon, M., Kapur, A., Manna, Z., Sipma, H. B., and Uribe, T. E., 1995, STEP The Stanford Temporal Prover Educational Release Version 1.0 User's Manual (California, USA: Computer Science Department, Stanford University).
4. Bolotov, A., and Fisher, M., 1997, A resolution method for CTL branching-time temporal logic. Proceedings of TIME-97 the Fourth International Workshop on Temporal Representation and Reasoning, Daytona Beach, Florida (IEEE Computer Society Press), pp. 20-27.
5. Carlsson, M., and Widen, J., 1991, SICStus Prolog User's Manual (Kista, Sweden: Swedish Institute of Computer Science).
6. Cavalli, A., and Farmas del Cerro, L, 1984, A decision method for linear temporal logic. Proceedings of the 7th International Conference on Automated Deduction, Vol. 170, Lecture Notes in Computer Science, edited by R. E. Shostak (Berlin: Springer-Verlag), pp. 113-127.
7. Dixon, C, 1995, Strategies for Temporal Resolution. PhD thesis, Department of Computer Science, University of Manchester, UK.
8. Dixon, C, 1996, Search strategies for resolution in temporal logics. Proceedings of the Thirteenth International Conference on Automated Deduction (CADE), Vol. 1104, Lecture Notes in Artificial Intelligence, edited by M. A. McRobbie and J. K. Slaney (New York: Springer-Verlag), pp. 672-687.
9. Dixon, C, 1997, Temporal resolution: removing irrelevant information. Proceedings of TIME-97 the Fourth International Workshop on Temporal Representation and Reasoning, Daytona Beach, Florida (IEEE Computer Society Press), pp. 4-11.
10. Dixon, C, 1998, Temporal resolution using a breadth-first search algorithm. Annals of Mathematics and Artificial Intelligence, 22: 87-115.
11. Dixon, C., Fisher, M., and Johnson, R, 1995, Parallel temporal resolution. Proceedings of TIME-95 the Second International Workshop on Temporal Representation and Reasoning, Melbourne Beach, Florida.
12. Dixon, C., Fisher, M., and Wooldridge, M, 1998, Resolution for temporal logics of knowledge. Journal of Logic and Computation, 8: 345-372.
13. Fisher, M., 1991, A resolution method for temporal logic. Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI), Sydney, Australia (Morgan Kaufman), pp. 99-104.
14. Fisher, M., 1992, A normal form for first-order temporal formulae. Proceedings of Eleventh International Conference on Automated Deduction (CADE), Vol. 607, Lecture Notes in Computer Science, Saratoga Springs (New York: Springer-Verlag), pp. 370-384.
15. Gabbay, D., Pnueli, A., Shelah, S., and Stavi, J., 1980, The temporal analysis of fairness. Proceedings of the Seventh ACM Symposium on the Principles of Programming Languages, Las Vegas, Nevada, pp. 163-173.
16. Gough, G. D., 1984, Decision Procedures for temporal logic. Master's thesis, Department of Computer Science, University of Manchester, UK; also Technical Report UMCS-89-10-1 (Manchester: University of Manchester, Department of Computer Science).
17. Hailpern, B. T., 1982, Verifying Concurrent Processes Using Temporal Logic, Vol. 129, Lecture Notes in Computer Science (Berlin: Springer-Verlag).
18. Heuerding, A., 1998, Sequent calculi for proof search in some modal logics, theory-implementation-applications. PhD thesis, University of Berne, Switzerland.
19. Jaeger, G., Heuerding, A., Schwendimann, S., Achermann, F., Balsiger, P., Brambilla, P., Zimmermann, H., Bianchi, M., Guggisberg, K., and Heinle, W., 1996, LWB-the Logics Workbench 1.0, http://lwbwww.unibe.ch:8080/LWBinfo.html (Switzerland: University of Berne).
20. Lichtenstein, O., Pnueli, A., and Zuck, L., 1985, The glory of the past. Logics of Programs (Proceedings of the Conference), Brooklyn, USA, Vol. 193, Lecture Notes in Computer Science, edited by R. Parikh (Berlin: Springer-Verlag) pp. 196-218.
21. Manna, Z., and Pnueli, A., 1981, Verification of concurrent programs: the temporal framework. The Correctness Problem in Computer Science, edited by R. S. Boyer, and J. S. Moore (London: Academic Press), pp. 215-273.
22. Manna, Z., and Pnueli, A., 1989, The anchored version of the temporal framework. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Vol. 354, Lecture Notes in Computer Science, edited by J. de Bakker, W.-P. de Roever and G. Rozenberg (Berlin: Springer-Verlag), pp. 201-284.
23. Manna, Z., and Pnueli, A., 1992, The Temporal Logic of Reactive and Concurrent Systems: Specification. (New York: Springer-Verlag).
24. Manna, Z., and Pnueli, A., 1995, Temporal Verification of Reactive Systems: Safety (New York: SpringerVerlag).
25. McCune, W. W., 1990, OTTER 2.0 Users Guide (9700 South Cass Avenue, Argonne, Illinois 60439-4801: Argonne National Laboratory), ANL-90/ 9.
26. Nonnengart, A., 1996, Resolution-based calculi for modal and temporal logics. Proceedings of the Thirteenth International Conference on Automated Deduction (CADE), Vol. 1104, Lecture Notes in Artificial Intelligence, edited by M. A. McRobbie, and J. K. Slaney (New York: Springer-Verlag), pp. 598-612.
27. Owicki, S., and Lamport, L., 1982, Proving liveness properties of concurrent programs. ACM Transactions on Programming Languages and Systems, 4(3): 455-495.
28. Peim, M., 1994, Propositional temporal resolution over labelled transition systems. Unpublished Technical Note (Manchester: Department of Computer Science, University of Manchester).
29. Peterson, G. L., 1981, Myths about the mutual exclusion problem. Information Processing Letters, 12(3): 115-116.
30. Pnueli, A., 1984, In transition from global to modular temporal reasoning about programs. Logics and Models of Concurrent Systems, edited by K. Apt (New York: NATO, Springer-Verlag), pp. 123-144.
31. Robinson, J. A., 1965, A machine-oriented logic based on the resolution principle. ACM Journal, 12(1): 23-41.
32. Sistla, A. P., and Clarke, E. M, 1985, Complexity of propositional linear temporal logics. ACM Journal, 32(3): 733-749.
33. Vardi, M. Y., and Wolper, P., 1986, An automata-theoretic approach to automatic program verification. Proceedings IEEE Symposium on Logic in Computer Science, Cambridge, pp. 332-344.
34. Venkatesh, G., 1986, A decision method for temporal logic based on resolution. Lecture Notes in Computer Science, 206: 272-289.
35. Wolper, P., 1985, The tableau method for temporal logic: an overview. Logique et Analyse, 110-111: 119-136.
36. Wolper, P., Vardi, M., and Sistla, A. P., 1983, Reasoning about infinite computation paths. Proceedings of the Twentyfourth Symposium on the Foundations of Computer Science (IEEE), pp. 185-194.
37. Wos, L., 1988, Automated reasoning: 33 basic research problems (Englewood Cliffs, New Jersey: Prentice-Hall).
38. Wos, L., Carson, D., and Robinson, G., 1964, The unit preference strategy in theorem proving. Proceedings of AFIPS Fall Joint Computer Conference (Thompson Book Company), pp. 615-621.
39. Wos, L., Robinson, G., and Carson, D., 1965, Efficiency and completeness of the set of support strategy in theorem proving. ACM Journal, 12: 536-541.