| * | 2009 |
|---|
| 10 | EE | Mark H. Liffiton,
Karem A. Sakallah:
Generalizing Core-Guided Max-SAT.
SAT 2009: 481-494 |
| 9 | EE | Mark H. Liffiton,
Maher N. Mneimneh,
Inês Lynce,
Zaher S. Andraus,
João Marques-Silva,
Karem A. Sakallah:
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas.
Constraints 14(4): 415-442 (2009) |
| 2008 |
|---|
| 8 | EE | Zaher S. Andraus,
Mark H. Liffiton,
Karem A. Sakallah:
Reveal: A Formal Verification Tool for Verilog Designs.
LPAR 2008: 343-352 |
| 7 | EE | Mark H. Liffiton,
Karem A. Sakallah:
Searching for Autarkies to Trim Unsatisfiable Clause Sets.
SAT 2008: 182-195 |
| 6 | EE | Mark H. Liffiton,
Karem A. Sakallah:
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints.
J. Autom. Reasoning 40(1): 1-33 (2008) |
| 2007 |
|---|
| 5 | EE | Sean Safarpour,
Hratch Mangassarian,
Andreas G. Veneris,
Mark H. Liffiton,
Karem A. Sakallah:
Improved Design Debugging Using Maximum Satisfiability.
FMCAD 2007: 13-19 |
| 2006 |
|---|
| 4 | EE | Zaher S. Andraus,
Mark H. Liffiton,
Karem A. Sakallah:
Refinement strategies for verification methods based on datapath abstraction.
ASP-DAC 2006: 19-24 |
| 2005 |
|---|
| 3 | EE | Mark H. Liffiton,
Michael D. Moffitt,
Martha E. Pollack,
Karem A. Sakallah:
Identifying Conflicts in Overconstrained Temporal Problems.
IJCAI 2005: 205-211 |
| 2 | EE | Mark H. Liffiton,
Karem A. Sakallah:
On Finding All Minimally Unsatisfiable Subformulas.
SAT 2005: 173-186 |
| 2004 |
|---|
| 1 | EE | Paul T. Darga,
Mark H. Liffiton,
Karem A. Sakallah,
Igor L. Markov:
Exploiting structure in symmetry detection for CNF.
DAC 2004: 530-534 |
