Ordered resolution vs. connection graph resolution

DOI10.1007/3-540-45744-5_14MaRDI QIDQ4540005zbMATH OpenFDO

Authors Reiner Hähnle, Neil V. Murray, Erik Rosenthal

Publication date 22 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45744-5_14

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 4047183
• An open research problem: strong completeness of R Kowalski's connection graph proof procedure
• An open research problem: Strong completeness of R. Kowalski's connection graph proof procedure
• Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution
• On linear resolution

Cited in

(2)

• Support ordered resolution
• Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution

This page was built for publication: Ordered resolution vs. connection graph resolution

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