Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.03022OpenAlexW2494235144MaRDI QIDQ5325874FDOQ5325874

Hans Kleine Büning, Xishun Zhao

Publication date: 24 July 2009

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

Full work available at URL: https://doi.org/10.1007/b95238

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35)

Cited In (4)

• Copy complexity of Horn formulas with respect to unit read-once resolution
• Finding read-once resolution refutations in systems of 2CNF clauses
• Analyzing read-once cutting plane proofs in Horn systems
• Title not available (Why is that?)

This page was built for publication: Theory and Applications of Satisfiability Testing

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