A labelled sequent system for tense logic Kt

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

Volumn 1502, Issue , 1998, Pages 71-82

  Bonnette, Nicolette ^a   Goré, Rajeev ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Automated deduction; Labelled deductive system; Lean deduction; Sequent system; Tense logic

Indexed keywords

COMPUTER CIRCUITS; PROLOG (PROGRAMMING LANGUAGE);

AUTOMATED DEDUCTION; LABELLED DEDUCTIVE SYSTEMS; LEAN DEDUCTION; SEQUENT SYSTEM; TENSE LOGIC;

ARTIFICIAL INTELLIGENCE;

EID: 84947926630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0095042     Document Type: Conference Paper

References (20)

1. [BG97] B Beckert and R Gore. Free variable tableaux for propositional modal logics. In Proc. TABLE A UX-97, LNCS 1227, pages 91-106. Springer, 1997.
2. t. Technical Report TR-ARP-1-1998, ARP, 1998. http://axp.anu.edu.au:80/ftp/techreports/1998/TR-ARP-l-1998.ps.gz.
3. AP: Lean tableau-based deduction. Journal of Automated Reasoning, 15(3):339-358, 1995.
4. [Fit83] M Fitting. Proof Methods for Modal and Intuitionistic Logics, volume 169 of Synthese Library. D. Reidel, Dordrecht, Holland, 1983.
5. [Fit98] M Fitting. Leantap revisited. J. of Logic and Computation, 8:33-47, 1998.
6. [Gab96] D Gabbay. Labelled Deductive Systems. Oxford University Press, 1996.
7. [Gor95] R Gore. Tableau methods for modal and temporal logics. Technical Report TR-ARP-15-1995, ANU, 1995.
8. [Gov95] G Governatori. Labelled tableaux for multi-modal logics. In Proc. TABLEAUX-95, LNCS 918, pages 79-94. Springer, 1995.
9. [HC84] G E Hughes and M J Cresswell. A Companion to Modal Logic. Methuen, London, 1984.
10. [HC96] G E Hughes and M J Cresswell. A New Introduction To Modal Logic. Routledge, 1996.
11. [HS96] A Heuerding and S Schwendimann. On the modal logic K plus theories. In Proc. CSL95, volume LNCS 1092, pages 308-319. Springer, 1996.
12. [HS98] U. Hustadt and R. A. Schmidt. Simplification and backjumping in modal tableau. In Proc. TABLEAUX-98, LNAI 1397, pages 189-201. Springer, 1998.
13. [HSZ96] A Heuerding, M Seyfried, and H Zimmermann. Efficient loop-check for backward proof search in some non-classical logics. In Proc. TABLEAUX-96, LNAI 1071, pages 210-225. Springer, 1996.
14. [Kan57] S. Kanger. Provability in Logic. Stockholm Studies in Philosophy, University of Stockholm, Almqvist and Wiksell, Sweden, 1957.
15. [Mas94] F Massacci. Strongly analytic tableaux for normal modal logics. In A Bundy, editor, Proc. CADE-12, LNAI 814, pages 723-737. Springer, 1994.
16. [Mas98] F Massacci. Simplification: a general constraint propagation technique for propositional and modal tableaux. In Proc. TABLEAUX-98, LNAI 1397, pages 217-231. Springer, 1998.
17. [NFKT87] H Nakamura, M Fujita, S Kono, and H Tanaka. Temporal logic based fast verification system using cover expressions. In C H Sequin, editor, Proceedings VLSI '87, pages 101-111, 1987.
18. [PC96] J Pitt and J Cunningham. Distributed modal theorem proving with KE. In Proc. TABLEAUX-96, LNAI 1071, pages 160-176. Springer, 1996.
19. [RU71] N Rescher and A Urquhart. Temporal Logic. Springer-Verlag, 1971.
20. [Sti96] C Stirling. Modal and temporal logics for processes. Lecture Notes in Computer Science, 1043:149-237, 1996.