Internalizing labelled deduction

Journal of Logic and Computation

Volumn 10, Issue 1, 2000, Pages 137-168

  Blackburn, Patrick ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES; MATHEMATICAL MODELS; THEOREM PROVING;

HYBRID LANGUAGES; LABELLED DEDUCTION; MODAL LOGIC; TENSE LOGIC;

FORMAL LOGIC;

EID: 0033900673     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/10.1.137     Document Type: Article

References (48)

1. J. Allen. Towards a general theory of knowledge and action. Artificial Intelligence, 23, 123-154, 1984.
2. C. Areces, P. Blackburn and M. Marx. Hybrid logics. Characterization, Interpolation and Complexity. CLAUS-Report 104, Computerlinguistik, University of Saarland, 1999. http://wwv.coli.uni-sb.de/cl/claus.
3. D. Basin, S. Matthews and L. Viganò. Labelled propositional modal logics: Theory and practice, Journal of Logic and Computation, 7, 685-717, 1997.
4. J. van Benthem. Programming operations that are safe for bisimulations. CSLI Report 93-179, Center for the Study of Language and Information, Stanford University, 1993.
5. P. Blackburn. Nominal Tense Logic and Other Sorted Intensional Frameworks. PhD Thesis, Centre for Cognitive Science, University of Edinburgh, 1990.
6. P. Blackburn. Nominal tense logic, Notre Dame Journal of Formal Logic. 14, 56-83, 1993.
7. P. Blackburn and J. Seligman. Hybrid languages, Journal of Logic, Language and Information, 4, 251-272, 1995.
8. P. Blackburn and J. Seligman. What are hybrid languages? In Advances in Modal Logic, Volume 1, M. Kracht, M. de Rijke, H. Wansing and M. Zakharyaschev, eds., pp. 41-62. CSLI Publications, Stanford University, 1998.
9. P. Blackburn and M. Tzakova. Hybrid completeness, Logic Journal of the IGPL, 4, 625-650, 1998. http://www.oup.co.uk/igpl.
10. P. Blackburn and M. Tzakova. Hybridizing concept languages, Annals of Mathematics and Artificial Intelligence, 24, 23-49, 1998.
11. P. Blackburn and M. Tzakova. Hybrid languages and temporal logic, Logic Journal of the IGPL, 7, 27-54, 1999. http://www.oup.co.uk/igpl.
12. P. Blackburn and M. Tzakova. Hybrid languages and temporal logic (full version). CLAUS-Report 96, Computerlinguistik, University of Saarland, 1998. http://www.coli.uni-sb.de/cl/claus.
13. R. Bull. An approach to tense logic. Theoria, 36, 282-300, 1998.
14. S. Buvač, V. Buvač and I. Mason. Metamathematics of contexts, Fundamenta Informaticae, 23, 263-301, 1998.
15. R. Carnap. Modalities and quantification, Journal of Symbolic Logic, 11, 33-64, 1946.
16. M. Cresswell. Entities and Indices. Kluwer, 1990.
17. S. Demri. Sequent calculi for nominal tense logics: a step towards mechanization? In Conference on Tableaux Calculi and Related Methods (TABLEAUX), Saratoga Springs, USA, N. Murray, ed., pp. 140-145, LNAI 1617, Springer Verlag, 1999.
18. S. Demri and R. Gore. Cut-free display calculi for nominal tense logics. In Conference on Tableaux Calculi and Related Methods (TABLEAUX), Saratoga Springs, USA, N. Murray, ed., pp. 155-170, LNAI 1617, Springer Verlag, 1999.
19. F. Donini, M. Lenzerini, D. Nardi and A. Schaerf. Reasoning in description logics. In Principles of Knowledge Representation, G. Brewka, ed., Studies in Logic, Language and Information, CSLI Publications, Stanford University, 1996.
20. M. Fitting. Proof Methods for Modal and Intuitionistic Logics. Reidel, 1983.
21. D. Gabbay. Labelled Deductive Systems. Oxford University Press, 1996.
22. D. Gabbay. An irreflexivity lemma. In Aspects of Philosophical Logic, U. Mönnich, ed., pp. 67-89. Reidel, 1981.
23. G. Gargov and V. Goranko. Modal logic with names, Journal of Philosophical Logic, 22, 607-636, 1993.
24. G. Gargov and S. Passy. Determinism and looping in combinatory PDL, Theoretical Computer Science, 61, 259-277, 1988.
25. G. Gargov, S. Passy and T.Tinchev. Modal environment for Boolean speculations (preliminary report). In Mathematical Logic and its Applications. Proceedings of the Summer School and Conference dedicated to the 80th Anniversary of Kurt Gödel, Druzhba, 1986, D. Skordev, ed., pp. 253-263. Plenum Press, 1987.
26. V. Goranko. Temporal logic with reference pointers. In Proceedings of the 1st International Conference on Temporal Logic, D. Gabbay and H. J. Ohlbach, eds., pp. 133-148, volume 827 of LNAI, Springer, 1994.
27. V. Goranko. Hierarchies of modal and temporal logics with reference pointers, Journal of Logic, Language and Information, 5, 1-24, 1996.
28. V. Goranko. An interpretation of computational tree logics into temporal logics with reference pointers. Technical Report 2/96, Verslagreeks van die Department Wiskunde, RAU, Department of Mathematics, Rand Afrikaans University, Johannesburg, South Africa, 1996.
29. P. Hasle. Building a temporal logic for natural language understanding with the HOL-system. In Natural Language Understanding and Logic Programming III, C. Brown and G. Koch, eds,. Elsevier Science Publishers, 1991.
30. W. Hodges. Logic. Penguin, 1977.
31. S. Kripke. A completeness theorem in modal logic. Journal of Symbolic Logic, 24, 1-14, 1959.
32. S. Kripke. Semantical considerations on modal logic, Acta Philosphica Fennica, 16, 83-94, 1963.
33. B. Konikowska. A logic for reasoning about relative similarity, Studio Logica, 58, 185-226, 1997.
34. R. Ladner. The computational complexity of provability in systems of modal prepositional logic, SIAM Journal of Computing, 6, 467-480, 1977.
35. J. McCarthy and P. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence 4, B. Meltzer and D. Michie, eds., Edinburgh University Press, 1969.
36. S. Passy and T. Tinchev. Quantifiers in combinatory PDL: completeness, definability, incompleteness. In Fundamentals of Computation Theory FCT 85, Volume 199 of LNCS, pp. 512-519. Springer, 1985.
37. S. Passy and T. Tinchev. An essay in combinatory dynamic logic. Information and Computation, 93, 263-332, 1991.
38. A. Prior. Past, Present and Future. Oxford University Press, Oxford, 1967.
39. A. Prior and K. Fine. Worlds, Times, and Selves. University of Massachusetts Press, 1977.
40. N. Rescher and A. Urquhart. Temporal Logic. Springer Verlag, 1971.
41. J. Seligman. A cut-free sequent calculus for elementary situated reasoning. Technical Report HCRC-RP 22, HCRC, Edinburgh, 1991.
42. J. Seligman. Situated consequence for elementary situation theory. Logic Group Preprint IULG-92-16, Indiana University, 1992.
43. J. Seligman. The logic of correct description. In Advances in Intensional Logic, M. de Rijke, ed., pp. 107-135. Applied Logic Series, Kluwer, 1997.
44. J. Seligman. Proof theory for contextual reasoning. Manuscript, 1998.
45. G. Smolka. Feature constraint logics for unification grammars, Journal of Logic Programming, 12, 51-87, 1992.
46. R. Smullyan. First-Order Logic. Springer-Verlag, 1968.
47. S. Thomason. Semantic analysis of tense logic, Journal of Symbolic Logic, 37, 150-158, 1972.
48. M. Tzakova. Tableaux calculi for hybrid logics. In Conference on Tableaux Calculi and Related Methods (TABLEAUX), Saratoga Springs, USA, N. Murray, ed., pp. 278-292, LNAI 1617, Springer Verlag, 1999.