Searching for autarkies to trim unsatisfiable clause sets

Mark Liffiton; Karem Sakallah

doi:10.1007/978-3-540-79719-7_18

Searching for autarkies to trim unsatisfiable clause sets

Mark Liffiton, Karem Sakallah

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Theory and Applications of Satisfiability Testing - SAT 2008 - 11th International Conference, SAT 2008, Proceedings
Pages	182-195
Number of pages	14
DOIs	https://doi.org/10.1007/978-3-540-79719-7_18
State	Published - 2008
Externally published	Yes
Event	11th International Conference on Theory and Applications of Satisfiability Testing, SAT 2008 - Guangzhou, China Duration: May 12 2008 → May 15 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4996 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	11th International Conference on Theory and Applications of Satisfiability Testing, SAT 2008
Country/Territory	China
City	Guangzhou
Period	5/12/08 → 5/15/08

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-79719-7_18

Cite this

Liffiton, M., & Sakallah, K. (2008). Searching for autarkies to trim unsatisfiable clause sets. In Theory and Applications of Satisfiability Testing - SAT 2008 - 11th International Conference, SAT 2008, Proceedings (pp. 182-195). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4996 LNCS). https://doi.org/10.1007/978-3-540-79719-7_18

Searching for autarkies to trim unsatisfiable clause sets. / Liffiton, Mark; Sakallah, Karem.
Theory and Applications of Satisfiability Testing - SAT 2008 - 11th International Conference, SAT 2008, Proceedings. 2008. p. 182-195 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4996 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Liffiton, M & Sakallah, K 2008, Searching for autarkies to trim unsatisfiable clause sets. in Theory and Applications of Satisfiability Testing - SAT 2008 - 11th International Conference, SAT 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4996 LNCS, pp. 182-195, 11th International Conference on Theory and Applications of Satisfiability Testing, SAT 2008, Guangzhou, China, 5/12/08. https://doi.org/10.1007/978-3-540-79719-7_18

Liffiton M, Sakallah K. Searching for autarkies to trim unsatisfiable clause sets. In Theory and Applications of Satisfiability Testing - SAT 2008 - 11th International Conference, SAT 2008, Proceedings. 2008. p. 182-195. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-79719-7_18

@inproceedings{324f1e3b127e415d8641616206b0bfae,

title = "Searching for autarkies to trim unsatisfiable clause sets",

author = "Mark Liffiton and Karem Sakallah",

year = "2008",

doi = "10.1007/978-3-540-79719-7_18",

language = "English",

isbn = "3540797181",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "182--195",

booktitle = "Theory and Applications of Satisfiability Testing - SAT 2008 - 11th International Conference, SAT 2008, Proceedings",

note = "11th International Conference on Theory and Applications of Satisfiability Testing, SAT 2008 ; Conference date: 12-05-2008 Through 15-05-2008",

}

TY - GEN

T1 - Searching for autarkies to trim unsatisfiable clause sets

AU - Liffiton, Mark

AU - Sakallah, Karem

PY - 2008

Y1 - 2008

UR - http://www.scopus.com/inward/record.url?scp=44649092830&partnerID=8YFLogxK

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

U2 - 10.1007/978-3-540-79719-7_18

DO - 10.1007/978-3-540-79719-7_18

M3 - Conference contribution

AN - SCOPUS:44649092830

SN - 3540797181

SN - 9783540797180

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 182

EP - 195

BT - Theory and Applications of Satisfiability Testing - SAT 2008 - 11th International Conference, SAT 2008, Proceedings

T2 - 11th International Conference on Theory and Applications of Satisfiability Testing, SAT 2008

Y2 - 12 May 2008 through 15 May 2008

ER -

Searching for autarkies to trim unsatisfiable clause sets

Publication series

Conference

ASJC Scopus Subject Areas

Access to Document

Other files and links

Cite this