scientific article; zbMATH DE number 4210103

MaRDI QIDQ3358707zbMATH OpenFDO

Authors Andreas Goerdt

Publication date 1990

zbMATH Keywords

complexity of resolution proofsN-resolutionunrestricted resolution

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• Unrestricted resolution versus N-resolution
• scientific article; zbMATH DE number 4039343
• Davis-Putnam resolution versus unrestricted resolution
• The intractability of resolution
• Regular Resolution Versus Unrestricted Resolution

Cited in

(11)

• Unrestricted resolution versus N-resolution
• Generalized resolution and NC-resolution
• Davis-Putnam resolution versus unrestricted resolution
• On resolution with short clauses
• Regular Resolution Versus Unrestricted Resolution
• scientific article; zbMATH DE number 4039343 (Why is no real title available?)
• scientific article; zbMATH DE number 4072434 (Why is no real title available?)
• scientific article; zbMATH DE number 15495 (Why is no real title available?)
• scientific article; zbMATH DE number 1090101 (Why is no real title available?)
• scientific article; zbMATH DE number 2094813 (Why is no real title available?)
• Linearity and regularity with negation normal form

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358707)