Counting the number of equivalent binary resolution proofs

DOI10.1007/3-540-45653-8_11MaRDI QIDQ2996160zbMATH OpenOpenAlexFDO

Authors J. D. Horton

Publication date 6 May 2011

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45653-8_11

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• scientific article; zbMATH DE number 1614709
• Extended resolution simulates binary decision diagrams
• scientific article; zbMATH DE number 1303352
• Efficient algorithms to detect and restore minimality, an extension of the regular restriction of resolution
• scientific article; zbMATH DE number 4072434

Cited in

(5)

• Efficient algorithms to detect and restore minimality, an extension of the regular restriction of resolution
• Resolution with counting: dag-like lower bounds and different moduli
• scientific article; zbMATH DE number 1614709 (Why is no real title available?)
• scientific article; zbMATH DE number 1303352 (Why is no real title available?)
• scientific article; zbMATH DE number 7650367 (Why is no real title available?)

This page was built for publication: Counting the number of equivalent binary resolution proofs

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