Fair derivations in monodic temporal reasoning

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

Volumn 5663 LNAI, Issue , 2009, Pages 261-276

  Ludwig, Michel ^a   Hustadt, Ullrich ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FIRST-ORDER TEMPORAL LOGIC; INFERENCE RULES; RESOLUTION-BASED CALCULI; TEMPORAL REASONING; THEOREM PROVERS;

AUTOMATION; COMPUTABILITY AND DECIDABILITY;

TEMPORAL LOGIC;

EID: 69949129857     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02959-2_21     Document Type: Conference Paper

References (15)

1. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 1, pp. 19-99. Elsevier, Amsterdam (2001)
2. Behdenna, A., Dixon, C., Fisher, M.: Deductive verification of simple foraging robotic behaviours (under review)
3. Degtyarev, A., Fisher, M., Konev, B.: Monodic temporal resolution. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 397-411. Springer, Heidelberg (2003)
4. Degtyarev, A., Fisher, M., Konev, B.: Monodic temporal resolution. ACM Transactions On Computational Logic 7(1), 108-150 (2006)
5. Emerson, E.A.: Temporal and modal logic. In: Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 995-1072 (1990)
6. Fisher, M., Dixon, C., Peim, M.: Clausal temporal resolution. ACM Transactions on Computational Logic 2(1), 12-56 (2001)
7. Gago, M.C.F., Fisher, M., Dixon, C.: Algorithms for guiding clausal temporal resolution. In: Jarke, M., Koehler, J., Lakemeyer, G. (eds.) KI 2002. LNCS, vol. 2479, pp. 235-252. Springer, Heidelberg (2002)
8. Hodkinson, I., Wolter, F., Zakharyaschev, M.: Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic 106, 85-134 (2000)
9. Hustadt, U., Konev, B., Riazanov, A., Voronkov, A.: TeMP: A temporal monodic prover. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 326-330. Springer, Heidelberg (2004)
10. Hustadt, U., Konev, B., Schmidt, R.A.: Deciding monodic fragments by temporal resolution. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 204-218. Springer, Heidelberg (2005)
11. Konev, B., Degtyarev, A., Dixon, C., Fisher, M., Hustadt, U.: Towards the implementation of first-order temporal resolution: the expanding domain case. In: Proc. TIME-ICTL 2003, pp. 72-82. IEEE Computer Society, Los Alamitos (2003)
12. Konev, B., Degtyarev, A., Dixon, C., Fisher, M., Hustadt, U.: Mechanising first-order temporal resolution. Information and Computation 199(1-2), 55-86 (2005)
13. Ludwig, M., Hustadt, U.: Implementing a fair monodic temporal logic prover. AI Communications (to appear)
14. Weidenbach, C., Schmidt, R., Hillenbrand, T., Rusev, R., Topic, D.: System description: SPASS version 3.0. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 514-520. Springer, Heidelberg (2007)
15. Wolter, F., Zakharyaschev, M.: Axiomatizing the monodic fragment of first-order temporal logic. Annals of Pure and Applied logic 118, 133-145 (2002)