Minimum Witnesses for Unsatisfiable 2CNFs
From MaRDI portal
Publication:5756552
DOI10.1007/11814948_6zbMath1187.68535OpenAlexW1564397736MaRDI QIDQ5756552
No author found.
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11814948_6
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity of proofs (03F20)
Related Items
Redundancy in logic. II: 2CNF and Horn propositional formulae ⋮ Computation of Renameable Horn Backdoors ⋮ Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas