A note on regular resolution

DOI10.1007/BF02243428zbMath0431.03036OpenAlexW390733291MaRDI QIDQ1137994

K. Justen

Publication date: 1981

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02243428

zbMATH Keywords

clausesregular resolution

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity of proofs (03F20)

Related Items

The complexity of Gentzen systems for propositional logic ⋮ The intractability of resolution

Cites Work

• On the complexity of regular resolution and the Davis-Putnam procedure
• Unnamed Item