Unrestricted resolution versus N-resolution

DOI10.1016/0304-3975(92)90216-3zbMath0745.68093OpenAlexW2076663305WikidataQ126352572 ScholiaQ126352572MaRDI QIDQ1185013

Andreas Goerdt

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90216-3

zbMATH Keywords

restriction\(N\)-resolutioncomplexity of proof systemstheorem-proving algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Exponential separation between Res(\(k\)) and Res(\(k+1\)) for \(k \leqslant \varepsilon\log n\) ⋮ Davis-Putnam resolution versus unrestricted resolution ⋮ The complexity of resolution refinements ⋮ On Exponential Lower Bounds for Partially Ordered Resolution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resolution proofs of generalized pigeonhole principles
• The intractability of resolution
• A Prolog technology theorem prover: Implementation by an extended Prolog compiler
• On the complexity of regular resolution and the Davis-Putnam procedure
• Many hard examples for resolution
• Hard examples for resolution
• Resolution, Refinements, and Search Strategies: A Comparative Study
• The relative efficiency of propositional proof systems
• The complexity of theorem-proving procedures

This page was built for publication: Unrestricted resolution versus N-resolution