论文信息 - Analytic Labelled ND and Proof Search

Analytic Labelled ND and Proof Search

LND system from Chapter 8 allows us to construct simple derivations but is not analytic. We have mentioned in Section 8.5 that one may obtain complete, universal and analytic version similarly as in Chapter 4; by step-wise simulation of every tableau with the help of only elimination rules and analytic applications of cut (i.e. [LRED]).

Andrzej Indrzejczak | Andrzej Indrzejczak

[1] R. Goldblatt. Logics of Time and Computation , 1987 .

[2] A. Nakamura,et al. On the size of refutation Kripke models for some linear modal and tense logics , 1980 .

[3] Ian Horrocks,et al. Practical Reasoning for Very Expressive Description Logics , 2000, Log. J. IGPL.

[4] Fabio Massacci,et al. Strongly Analytic Tableaux for Normal Modal Logics , 1994, CADE.

[5] Andrzej Indrzejczak,et al. A Labelled Natural Deduction System for Linear Temporal Logic , 2003, Stud Logica.

[6] D. Gabbay,et al. Handbook of tableau methods , 1999 .

[7] Melvin Fitting,et al. First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[8] M. Fitting. Proof Methods for Modal and Intuitionistic Logics , 1983 .

[9] Rajeev Goré,et al. Tableau Methods for Modal and Temporal Logics , 1999 .

[10] Maarten Marx,et al. The Mosaic Method for Temporal Logics , 2000, TABLEAUX.

[11] Alasdair Urquhart,et al. Temporal Logic , 1971 .