The following pages link to Mark H. Liffiton (Q272006):
Displayed 10 items.
- Fast, flexible MUS enumeration (Q272009) (← links)
- Item:Q272006 (redirect page) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741) (← links)
- Searching for Autarkies to Trim Unsatisfiable Clause Sets (Q3502707) (← links)
- Generalizing Core-Guided Max-SAT (Q3637181) (← links)
- Enumerating Infeasibility: Finding Multiple MUSes Quickly (Q4922910) (← links)
- Reveal: A Formal Verification Tool for Verilog Designs (Q5505565) (← links)
- Theory and Applications of Satisfiability Testing (Q5713708) (← links)