Unsatisfiable core

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Dershowitz, N.; Hanna, Z.; Nadel, A. (2006). "A Scalable Algorithm for Minimal Unsatisfiable Core Extraction" (PDF). In Biere, A.; Gomes, C.P. (eds.). Theory and Applications of Satisfiability Testing — SAT 2006. Lecture Notes in Computer Science. Vol. 4121. Springer. pp. 36–41. arXiv:cs/0605085. CiteSeerX 10.1.1.101.5209. doi:10.1007/11814948_5. ISBN 978-3-540-37207-3. S2CID 2845982. <a href="978-3-540-37207-3" target="_blank">978-3-540-37207-3</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Szeider, Stefan (December 2004). "Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable". Journal of Computer and System Sciences. 69 (4): 656–674. CiteSeerX 10.1.1.634.5311. doi:10.1016/j.jcss.2004.04.009. <a href="/wiki/Stefan_Szeider" target="_blank">/wiki/Stefan_Szeider</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Liffiton, M.H.; Sakallah, K.A. (2008). "Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints" (PDF). J Autom Reason. 40: 1–33. CiteSeerX 10.1.1.79.1304. doi:10.1007/s10817-007-9084-z. S2CID 11106131. <a href="http://www.iwu.edu/~mliffito/publications/jar_liffiton_CAMUS.pdf" target="_blank">http://www.iwu.edu/~mliffito/publications/jar_liffiton_CAMUS.pdf</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>"Complexity of computing minimum unsatisfiable core". Theoretical Computer Science Stack Exchange. Retrieved 2024-09-24. <a href="https://cstheory.stackexchange.com/questions/54692/complexity-of-computing-minimum-unsatisfiable-core" target="_blank">https://cstheory.stackexchange.com/questions/54692/complexity-of-computing-minimum-unsatisfiable-core</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
</ol>

Unsatisfiable core open-in-new

Unsatisfiable core