On finding all minimally unsatisfiable subformulas

Mark H. Liffiton; Karem A. Sakallah

doi:10.1007/11499107_13

On finding all minimally unsatisfiable subformulas

Mark H. Liffiton, Karem A. Sakallah

Research output: Journal Article › Conference article › peer-review

Original language	English
Pages (from-to)	173-186
Number of pages	14
Journal	Lecture Notes in Computer Science
Volume	3569
DOIs	https://doi.org/10.1007/11499107_13
State	Published - 2005
Externally published	Yes
Event	8th International Conference on Theory and Applications of Satisfiability Testing, SAT 2005 - St Andrews, United Kingdom Duration: Jun 19 2005 → Jun 23 2005

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11499107_13

Cite this

@article{732ca1fc423143a98e8ecf775bb6f7ef,

title = "On finding all minimally unsatisfiable subformulas",

author = "Liffiton, \{Mark H.\} and Sakallah, \{Karem A.\}",

year = "2005",

doi = "10.1007/11499107\_13",

language = "English",

volume = "3569",

pages = "173--186",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

note = "8th International Conference on Theory and Applications of Satisfiability Testing, SAT 2005 ; Conference date: 19-06-2005 Through 23-06-2005",

}

TY - JOUR

T1 - On finding all minimally unsatisfiable subformulas

AU - Liffiton, Mark H.

AU - Sakallah, Karem A.

PY - 2005

Y1 - 2005

UR - https://www.scopus.com/pages/publications/26444450510

UR - https://www.scopus.com/inward/citedby.url?scp=26444450510&partnerID=8YFLogxK

U2 - 10.1007/11499107_13

DO - 10.1007/11499107_13

M3 - Conference article

AN - SCOPUS:26444450510

SN - 0302-9743

VL - 3569

SP - 173

EP - 186

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 8th International Conference on Theory and Applications of Satisfiability Testing, SAT 2005

Y2 - 19 June 2005 through 23 June 2005

ER -

On finding all minimally unsatisfiable subformulas

ASJC Scopus Subject Areas

Access to Document

Other files and links

Cite this