Optimal length tree-like resolution refutations for 2SAT formulas

DOI10.1145/976706.976711zbMath1367.68114OpenAlexW2064512355MaRDI QIDQ5277698

No author found.

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/976706.976711

zbMATH Keywords

resolutiontree-like proofs2SAT formulas

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of proofs (03F20)

Related Items (3)

Integer feasibility and refutations in UTVPI constraints using bit-scaling ⋮ Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints ⋮ Finding read-once resolution refutations in systems of 2CNF clauses

This page was built for publication: Optimal length tree-like resolution refutations for 2SAT formulas