Minimum Witnesses for Unsatisfiable 2CNFs

DOI10.1007/11814948_6MaRDI QIDQ5756552zbMATH OpenOpenAlexFDO

Authors

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity of proofs (03F20)

Recommendations

• scientific article; zbMATH DE number 1955763
• An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
• Optimal length tree-like resolution refutations for 2SAT formulas
• Two tractable subclasses of minimal unsatisfiable formulas
• The complete set of minimal simple graphs that support unsatisfiable 2-CNFs

Cited in

(6)

• Optimal length tree-like resolution refutations for 2SAT formulas
• Computation of Renameable Horn Backdoors
• Redundancy in logic. II: 2CNF and Horn propositional formulae
• The complete set of minimal simple graphs that support unsatisfiable 2-CNFs
• Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
• scientific article; zbMATH DE number 1955763 (Why is no real title available?)

This page was built for publication: Minimum Witnesses for Unsatisfiable 2CNFs

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