Minimum 2CNF Resolution Refutations in Polynomial Time

DOI10.1007/978-3-540-72788-0_29zbMath1214.68345OpenAlexW1588707965MaRDI QIDQ3612473

No author found.

Publication date: 10 March 2009

Published in: Theory and Applications of Satisfiability Testing – SAT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72788-0_29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Integer feasibility and refutations in UTVPI constraints using bit-scaling ⋮ The incremental satisfiability problem for a two conjunctive normal form

This page was built for publication: Minimum 2CNF Resolution Refutations in Polynomial Time