Monodic temporal resolution

ACM Transactions on Computational Logic

Volumn 7, Issue 1, 2006, Pages 108-150

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

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Automated theorem proving; Resolution; Temporal logic

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION MAKING; OPTICAL RESOLVING POWER; PROBLEM SOLVING;

AUTOMATED THEOREM PROVING; COROLLARIES; MONADIC FRAGMENT; TEMPORAL LOGIC;

FORMAL LOGIC;

EID: 33745268458     PISSN: 15293785     EISSN: 15293785     Source Type: Journal    
DOI: 10.1145/1119439.1119443     Document Type: Article

References (45)

1. AHTALE, A. AND FBANCONI, E. 2004. Temporal description logics. In Handbook of Temporal Reasoning In Artificial Intelligence, M. Fisher, D. M. Gabbay, and L. Vila, Eds. Elsevier, Amsterdam, The Netherlands.
2. ARTALE, A., FRANCONI, E., WOLTER, F., AND ZAKHARYASCHEV, M. 2002. A temporal description logic for reasoning over conceptual schemas and queries. In Proceedings of JELIA'02. Lecture Notes in Computer Science, vol. 2424. Springer, Berlin, Germany, 98-110.
3. BACHMAIR, L. AND GANZINGER, H. 2001. Resolution theorem proving. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Elsevier, Amsterdam, The Netherlands, Chapter 2, 19-99.
4. BÖRGER, E., GRÄDEL, E., AND GUREVICH, Y. 1997. The Classical Decision Problem. Springer, Berlin, Germany.
5. DEGTYAREV, A. AND FISHER, M. 2001. Towards first-order temporal resolution. In KI 2001, Proceedings. Lecture Notes in Computer Science, vol. 2174. Springer, Berlin, Germany, 18-32.
6. DEGTYAREV, A., FISHER, M., AND KONEV, B. 2002a. A simplified clausal resolution procedure for propositional linear-time temporal logic. In Tableaux 2002, Proceedings. Lecture Notes in Computer Science, vol. 2381. Springer, Berlin, Germany, 85-99.
7. DEGTYAREV, A., FISHER, M., AND KONEV, B. 2003a. Handling equality in monodic temporal resolution. In Proceedings of 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR). Lecture Notes in Computer Science, vol. 2850. Springer-Verlag, Berlin, Germany, 214-228.
8. DEGTYAREV, A., FISHER, M., AND KONEV, B. 2003b. Monodic temporal resolution. In Proc. CADE-19. Lecture Notes in Artificial Intelligence, vol. 2741. Springer, Berlin, Germany, 397-411.
9. DEGTYAREV, A., FISHER, M., AND LISITSA, A. 2002b. Equality and monodic first-order temporal logic. Studia, Logica 72, 2, 147-156.
10. DIXON, C. 1996. Search strategies for resolution in temporal logics. In Proceedings of the CADE-13. Lecture Notes in Artificial Intelligence, vol. 1104. Springer, Berlin, Germany, 673-687.
11. FERMÜLLER, C., LEITSCH, A., HUSTADT, U., AND TAMMET, T. 2001. Resolution decision procedures. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Elsevier, Amsterdam, The Netherlands, Volume II, Chapter 25, 1791-1850.
12. FISHER, M. 1991. A resolution method for temporal logic. In Proceedings of IJCAI'91, J. Myopoulos and R. Reiter, Eds. Morgan Kaufman, San Francisco, CA, 99-104.
13. FISHER, M. 1992. A normal form for first-order temporal formulae. In Proceedings of the 11th International Conference on Automated Deduction, D. Kapur, Ed. Lecture Notes in Artificial Intelligence, vol. 607. Springer Verlag, Berlin, Germany, 370-384.
14. FISHER, M. 1997. A normal form for temporal logics and its applications in theorem proving and execution. J. Logic Computat. 7, 4, 429-456.
15. FISHER, M., DIXON, C., AND PEIM, M. 2001. Clausal temporal resolution. ACM Trans. Computat. Logic 2, 1, 12-56.
16. FISHER, M. AND GHIDINI, C. 2002. The ABC of rational agent programming. In Proceedings of the First International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). ACM Press, New York, NY, 849-856.
17. FISHER, M. AND LISITSA, A. 2003. Deductive verification of cache coherence protocols. In Proceedings of 3rd International Workshop on Automated Verification of Critical Systems (AVoCS 2003; Southampton, U.K.). 177-186.
18. GABBAY, D. 1987. Declarative past and imperative future: Executive temporal logic for interactive systems. In Proceedings on Colloquium on Temporal Logic, and Specification, B. Banieqbal, H. Barringer, and A. Pnueli, Eds. Lecture Notes in Computer Science, vol. 398. Springer Verlag, Berlin, Germany, 402-450.
19. GABELAIA, D., KONTCHAKOV, R., KURUCZ, A., WOLTER, F., AND ZAKHARYASCHEV, M. 2003. On the computational complexity of spatio-temporal logics. In Proceedings of the 16th International FLAIRS Conference. AAAI Press, Menlo Park, CA, 460-464.
20. GALLIER, H. 1986. Logic for Computer Science. Harper and Row, New York, NY.
21. GANZINGER, H. AND DE NIVELLE, H. 1999. A superposition decision procedure for the guarded fragment with equality. In Proceedings of the 14th IEEE Symposium on Logic in Computer Science. 295-305.
22. HODKINSON, I. 2002. Monodic packed fragment with equality is decidable. Studia Logica 72, 185-197.
23. HODKINSON, I., WOLTER, F., AND ZAKHARYASCHEV, M. 2000. Decidable fragments of first-order temporal logics. Ann. Pure Appl. Logic 106, 85-134.
24. HOLZMANN, G. J. 1997. The model checker Spin. IEEE Trans. Softw. Eng. 23, 5, 279-295.
25. HUSTADT, U. AND KONEV, B. 2003. TRP++ 2.0: A temporal resolution prover. In Proceedings of CADE-19. Lecture Notes in Artificial Intelligence, vol. 2741. Springer, Berlin, Germany, 274-278.
26. HUSTADT, U., KONEV, B., VOHONKOV, A., AND RIAZANOV, A. 2004. TeMP: A temporal monodic prover. Tech. rep. ULCS-04-004. Department of Computer Science, University of Liverpool, Liverpool, U.K. Also published in Proceedings of UCAR 2004. Lecture Notes in Artificial Intelligence, vol. 3097. Springer, Berlin, Germany, 326-330.
27. HUSTADT, U. AND SCHMIDT, R. A. 1999. Maslov's class K revisited. In Proceedings of the 16th International Conference on Automated Deduction (CADE-16), H. Ganzinger, Ed. Lecture Notes in Artificial Intelligence, vol. 1632. Springer, Berlin, Germany, 172-186.
28. KAIVOLA, R. 1995. Axiomatising linear-time mu-calculus. In Proceedings of Concur'95.
29. KESTEN, Y. AND PNUELI, A. 1995. A complete proof system for QPTL. In Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos, CA, 2-12.
30. KONEV, B., DEGTYAREV, A., DIXON, C., FISHER, M., AND HUSTADT, U. 2003. Towards the implementation of first-order temporal resolution: The expanding domain case. In Proceedings TIME-ICTL'03. IEEE Computer Society Press, Los Alamitos, CA, 72-82.
31. KONEV, B., DEGTYAREV, A., DIXON, C., FISHER, M., AND HUSTADT, U. 2005. Mechanizing first-order temporal resolution. Inform. Computat. 199, 1-2, 55-86.
32. KONTCHAKOV, R., LUTZ, C., WOLTER, F., AND ZAKHARYASCHEV, M. 2004. Temporalising tableaux. Studia Logica, 76, 1, 91-134.
33. MANNA, Z. AND PNUELI, A. 1992. The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer, Berlin, Germany.
34. MASLOV, S. 1968. The inverse method for establishing deducibility for logical calculi. Trudy Math. Inst. Steklov XCVIII, 22-25. (English translation AMS 1971.)
35. MERZ, S. 1992. Decidability and incompleteness results for first-order temporal logic of linear time. J. Appl. Non-Class. Logics 2, 139-156.
36. NONNENGART, A. AND WEIDENBACH, C. 2001. Computing small clause normal forms. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Elsevier, Amsterdam, The Netherlands, Chapter 6, 335-370.
37. PLAISTED, D. AND GREENBAUM, S. 1986. A structure-preserving clause form transformation. J. Symbol. Computat. 2, 3 (Sept.), 293-304.
38. PNUELI, A. 1977. The temporal logic of programs. In Proceedings of the Eighteenth Symposium on the Foundations of Computer Science. 46-57.
39. RlAZANOV, A. AND VORONKOV, A. 2001. Vampire 1.1 (system description). In Proceedings of IJCAR 2001. Lecture Notes in Computer Science, vol. 2083. Springer, Berlin, Germany.
40. SZALAS, A. AND HOLENDEHSKI, L. 1988. Incompleteness of first-order temporal logic with until. Theoret. Comput. Sci. 57, 317-325.
41. TSEITIN, G. 1983. On the complexity of derivations in prepositional calculus. In Automation of Reasoning (Classical Papers on Computational Logic), J. Siekmann and G. Wrightson, Eds. Springer Verlag, Berlin, Germany, vol. 2, 466-483. (Original article (in Russian) appeared in 1968.)
42. WOLPER, P. 1982. Synthesis of communicating processes from temporal logic specifications. Ph.D. dissertation. Stanford University, Stanford, CA.
43. WOLTER, F. AND ZAKHARYASCHEV, M. 2001. Decidable fragments of first-order modal logics. J. Symbol. Logic 66, 1415-1438.
44. WOLTER, F. AND ZAKHARYASCHEV, M. 2002a. Axiomatizing the monodic fragment of first-order temporal logic. Ann. Pure Appl. logic 118, 133-145.
45. WOLTER, F. AND ZAKHARYASCHEV, M. 2002b. Qualitative spatio-temporal representation and reasoning: A computational perspective. In Exploring Artificial Intelligence in the New Millenium. Morgan Kaufmann, San Francisco, CA, 175-216.