Monodic temporal resolution

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

Volumn 2741, Issue , 2003, Pages 397-411

  Degtyarev, Anatoly ^b   Fisher, Michael ^a   Konev, Boris ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; CALCULATIONS; TEMPORAL LOGIC; THEOREM PROVING; ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE;

FIRST-ORDER TEMPORAL LOGIC; RESOLUTION-BASED CALCULI; SEARCH ALGORITHMS; TEMPORAL RESOLUTION; LOOP-SEARCH ALGORITHMS; MONODIC TEMPORAL RESOLUTION; TEMPORAL RESOLUTION SYSTEM;

COMPUTER CIRCUITS; FORMAL LOGIC;

EID: 7044221793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_35     Document Type: Conference Paper

References (15)

1. A. Degtyarev and M. Fisher. Towards first-order temporal resolution. In KI 2001, Proceedings, volume 2174 of LNCS, pages 18-32. Springer, 2001.
2. A. Degtyarev, M. Fisher, and B. Konev. A simplified clausal resolution procedure for propositional linear-time temporal logic. In Tableaux 2002, Proceedings, volume 2381 of Lecture Notes in Computer Science, pages 85-99. Springer, 2002.
3. A. Degtyarev, M. Fisher, and B. Konev. Monodic temporal resolution. Technical Report ULCS-03-001, University of Liverpool, Department of Computer Science, 2003. http://www.csc.liv.ac.uk/research/.
4. C. Dixon. Search strategies for resolution in temporal logics. In Proc. CADE-13, volume 1104 of LNAI, pages 673-687. Springer, 1996.
5. M. Fisher. A resolution method for temporal logic. In J. Myopoulos and R. Reiter, editors, Proc. IJCAI’91, pages 99-104. Morgan Kaufman, 1991.
6. M. Fisher. A normal form for temporal logics and its applications in theorem proving and execution. Journal of Logic and Computation, 7(4):429-456, 1997.
7. M. Fisher, C. Dixon, and M. Peim. Clausal temporal resolution. ACM Transactions on Computational Logic, 2(1):12-56, 2001.
8. I. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic, 106:85-134, 2000.
9. G. J. Holzmann. The model checker Spin. IEEE Trans. on Software Engineering, 23(5):279-295, 1997.
10. R. Kontchakov, C. Lutz, F. Wolter, and M. Zakharyaschev. Temporalising tableaux. Studia Logica, to appear.
11. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, 1992.
12. S. Merz. Decidability and incompleteness results for first-order temporal logic of linear time. Journal of Applied Non-Classical Logics, 2:139-156, 1992.
13. A Pnueli. The Temporal Logic of Programs. In Proceedings of the Eighteenth Symposium on the Foundations of Computer Science, 1977.
14. A. Szalas and L. Holenderski. Incompleteness of First-Order Temporal Logic with Until. Theoretical Computer Science, 57:317-325, 1988.
15. F. Wolter and M. Zakharyaschev. Axiomatizing the monodic fragment of first-order temporal logic. Annals of Pure and Applied logic, 118:133-145, 2002.