Towards first-order temporal resolution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2174, Issue , 2001, Pages 18-32

  Degtyarev, Anatoli ^a   Fisher, Michael ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; TEMPORAL LOGIC;

AXIOMATIZATION; FIRST ORDER; FIRST ORDER LOGIC; FIRST-ORDER TEMPORAL LOGIC; PROOF SYSTEM; SATISFIABILITY PROBLEMS; TEMPORAL FORMULAE; TEMPORAL RESOLUTION;

ARTIFICIAL INTELLIGENCE;

EID: 84974739759     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45422-5_3     Document Type: Conference Paper

References (18)

1. S. Abiteboul, V. Vianu, B. Fordham, and Y. Yesha. Relational transducers for electronic commerce. In Proceedings of 17th Symposium on Database Systems (PODS’1998), pages 179-187. ACM Press, 2000.
2. L. Bachmair and H. Ganzinger. Resolution theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume 1, pages 19-100. Elsevier Science and MIT Press, 2001.
3. E. Börger, E. Grädel, and Yu. Gurevich. The Classical Decision Problem. Springer Verlag, 1997.
4. A. Degtyarev and M. Fisher. Propositional temporal resolution revised. In H.J. Ohlbach, editor, Proc. of 7th UK Workshop on Automated Reasoning (ARW’00), London, U.K., June 2000.
5. M. Fisher, C. Dixon, and M. Peim. Clausal temporal resolution. ACM Transactions on Computation Logic, 2(1), January 2001.
6. M. Fisher. A resolution method for temporal logic. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI’91), 1991.
7. M. Fisher. A normal form for first-order temporal formulae. In D. Kapur, editor, 11th International Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, Saratoga Springs, USA, 1992. Springer Verlag.
8. M. Fisher. Anormal form for temporal logics and its applications in theorem-proving and execution. Journal of Logic and Computation, 7(4), 1997.
9. C.G. Fermüller, A. Leitsch, U. Hustadt, and T. Tammet. Resolution decision procedures. In A. Robinson and A.Voronkov, editors, Handbook of Automated Reasoning, volume 2, pages 1791-1852. Elsevier Science and MIT Press, 2001.
10. D. Gabbay. Declarative past and imperative future:executive temporal logic for interactive systems. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Proceedings on Colloquium on Temporal Logic and Specification, volume 398 of Lecture Notes in Computer Science, pages 402-450, Altrincham, U.K., 1987. Springer Verlag.
11. I. Hodkinson, F. Wolter, and M. Zakharyaschev. Fragments of first-order temporal logics. Annals of Pure and Applied logic, 106:85-134, 2000.
12. D.A. Plaisted and S.A. Greenbaum. A structure-preserving clause form transformation. Journal of Symbolic Computation, 2(3):293-304, September 1986.
13. M. Spielmann. Verification of relational transducers for electronic commerce. In Proceedings of 19th Symposium on Database Systems (PODS’2000), pages 92-103, Dallas, Texas, 2000. ACM Press.
14. A. Szalas. Concerning the semantic consequence relation in first-order temporal logic. Theoretical Computer Science, 47:329-334, 1986.
15. P. Wolper. Syshthesis of Communicating Processes from Temporal Logic Specifications. Ph.d. dissertation, Stanford University, 1982.
16. M. Wolter, and.Zakharyaschev. Spatio-temporal representation and reasoning based on RCC-8. In Proceedings of the 7th Conference on Principles of Knowledge Representation and Reasoning (KR’2000), pages 3-14, Montreal, Canada, 2000.
17. F. Wolter and M. Zakharyaschev. Axiomatizing the monodic fragment of first-order temporal logic. To appear in Annals of Pure and Applied logic., 2001.
18. N. Zamov. The resolution method without skolemization. Soviet Mathematical Doklady, 293(5):1046-1049, 1987.