Enumerating infeasibility: Finding multiple MUSes quickly

Mark H. Liffiton; Ammar Malik

doi:10.1007/978-3-642-38171-3_11

Enumerating infeasibility: Finding multiple MUSes quickly

Mark H. Liffiton, Ammar Malik

Illinois Wesleyan University

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

Original language	English
Title of host publication	Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 10th International Conference, CPAIOR 2013, Proceedings
Pages	160-175
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-38171-3_11
State	Published - 2013
Event	10th International Conference on the Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2013 - Yorktown Heights, NY, United States Duration: May 18 2013 → May 22 2013

Publication series

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

Conference

Conference	10th International Conference on the Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2013
Country/Territory	United States
City	Yorktown Heights, NY
Period	5/18/13 → 5/22/13

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-38171-3_11

Cite this

Liffiton, M. H., & Malik, A. (2013). Enumerating infeasibility: Finding multiple MUSes quickly. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 10th International Conference, CPAIOR 2013, Proceedings (pp. 160-175). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7874 LNCS). https://doi.org/10.1007/978-3-642-38171-3_11

Enumerating infeasibility: Finding multiple MUSes quickly. / Liffiton, Mark H.; Malik, Ammar.
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 10th International Conference, CPAIOR 2013, Proceedings. 2013. p. 160-175 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7874 LNCS).

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

Liffiton, MH & Malik, A 2013, Enumerating infeasibility: Finding multiple MUSes quickly. in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 10th International Conference, CPAIOR 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7874 LNCS, pp. 160-175, 10th International Conference on the Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2013, Yorktown Heights, NY, United States, 5/18/13. https://doi.org/10.1007/978-3-642-38171-3_11

Liffiton MH, Malik A. Enumerating infeasibility: Finding multiple MUSes quickly. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 10th International Conference, CPAIOR 2013, Proceedings. 2013. p. 160-175. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-38171-3_11

Liffiton, Mark H. ; Malik, Ammar. / Enumerating infeasibility : Finding multiple MUSes quickly. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 10th International Conference, CPAIOR 2013, Proceedings. 2013. pp. 160-175 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{782284c4213048bbad3a338a3145c331,

title = "Enumerating infeasibility: Finding multiple MUSes quickly",

author = "Liffiton, {Mark H.} and Ammar Malik",

year = "2013",

doi = "10.1007/978-3-642-38171-3_11",

language = "English",

isbn = "9783642381706",

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

pages = "160--175",

booktitle = "Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 10th International Conference, CPAIOR 2013, Proceedings",

note = "10th International Conference on the Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2013 ; Conference date: 18-05-2013 Through 22-05-2013",

}

TY - GEN

T1 - Enumerating infeasibility

T2 - 10th International Conference on the Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2013

AU - Liffiton, Mark H.

AU - Malik, Ammar

PY - 2013

Y1 - 2013

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

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

U2 - 10.1007/978-3-642-38171-3_11

DO - 10.1007/978-3-642-38171-3_11

M3 - Conference contribution

AN - SCOPUS:84879924242

SN - 9783642381706

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

SP - 160

EP - 175

BT - Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 10th International Conference, CPAIOR 2013, Proceedings

Y2 - 18 May 2013 through 22 May 2013

ER -

Enumerating infeasibility: Finding multiple MUSes quickly

Publication series

Conference

ASJC Scopus Subject Areas

Access to Document

Other files and links

Cite this