On finding all minimally unsatisfiable subformulas

Mark H. Liffiton, Karem A. Sakallah

Research output: Journal ArticleConference articlepeer-review

Original languageEnglish
Pages (from-to)173-186
Number of pages14
JournalLecture Notes in Computer Science
Volume3569
DOIs
StatePublished - 2005
Externally publishedYes
Event8th International Conference on Theory and Applications of Satisfiability Testing, SAT 2005 - St Andrews, United Kingdom
Duration: Jun 19 2005Jun 23 2005

ASJC Scopus Subject Areas

  • Theoretical Computer Science
  • General Computer Science

Cite this