Unrestricted Resolution versus N-Resolution

An N-resolution proof is a resolution proof in which the resolution rule is restricted: One clause to which it is applied must only consist of negative literals. N-resolution is complete. ([8], p. 109,

[1]  Jack Minker,et al.  Resolution, Refinements, and Search Strategies: A Comparative Study , 1976, IEEE Transactions on Computers.

[2]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

[3]  Mark E. Stickel,et al.  An Introduction to Automated Deduction , 1985, Advanced Course: Fundamentals of Artificial Intelligence.

[4]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[5]  Alasdair Urquhart,et al.  Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

[6]  Samuel R. Buss,et al.  Resolution Proofs of Generalized Pigeonhole Principles , 1988, Theor. Comput. Sci..

[7]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[8]  Miklós Ajtai,et al.  The complexity of the Pigeonhole Principle , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.