论文信息 - A Unification of Ordering Refinements of Resolution in Classical Logic

A Unification of Ordering Refinements of Resolution in Classical Logic

We introduce a general notion of resolution calculus. We show that it is possible to obtain a resolution calculus from a semantic tableau calculus that can be described by rules of a certain type. It is also possible to obtain an ordered resolution calculus from a semantic tableau calculus. We apply this to classical logic to obtain simple proofs of the completeness of several refinements of resolution in classical logic.

Hans de Nivelle | H. D. Nivelle

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

[2] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[3] Patrice Enjalbert,et al. Modal Resolution in Clausal Form , 1989, Theor. Comput. Sci..

[4] Christian G. Fermüller,et al. Resolution Methods for the Decision Problem , 1993, Lecture Notes in Computer Science.

[5] Grigori Mints,et al. Gentzen-type systems and resolution rules. Part I. Propositional logic , 1990, Conference on Computer Logic.

[6] Peter Baumgartner. An Order Theory Resolution Calculus , 1992, LPAR.

[7] Donald W. Loveland,et al. Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[8] William H. Joyner. Resolution Strategies as Decision Procedures , 1976, JACM.

[9] Hans de Nivelle. Generic Resolution in Propositional Modal Systems , 1993, LPAR.