论文信息 - RESOLUTION BASED NATURAL DEDUCTION

RESOLUTION BASED NATURAL DEDUCTION

The paper is an introductory presentation of a hybrid formal system that mix some features of Natural Deduction systems and Resolution. Resulting system, called RND (Resolution based ND), allows to build derivations in particularly simple and natural manner. Moreover, in RND one can simulate other methods of proof. It seems to make RND particularly useful frame for comparison of e‐ciency of several proof-search strategies.

Andrzej Indrzejczak | Andrzej Indrzejczak

[1] Andrzej Indrzejczak,et al. Jaśkowski and Gentzen Approaches to Natural Deduction and Related Systems , 1998 .

[2] Zbigniew Stachniak. Resolution proof systems - an algebraic theory , 1996, Automated reasoning series.

[3] R. Smullyan. First-Order Logic , 1968 .

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

[5] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

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

[7] Melvin Fitting,et al. Destructive Modal Resolution , 1990, J. Log. Comput..

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

[9] Jean H. Gallier,et al. Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

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

[11] Marcello D'Agostino,et al. Tableau Methods for Classical Propositional Logic , 1999 .