Author of the publication

A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas.

, , , , , and . Constraints An Int. J., 14 (4): 415-442 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Identifying Conflicts in Overconstrained Temporal Problems., , , and . IJCAI, page 205-211. Professional Book Center, (2005)Patterns of Student Help-Seeking When Using a Large Language Model-Powered Programming Assistant., , , and . ACE, page 49-57. ACM, (2024)Analyzing Infeasible Constraint Systems.. University of Michigan, USA, (2009)A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas., , , , , and . Constraints An Int. J., 14 (4): 415-442 (2009)Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints., and . J. Autom. Reason., 40 (1): 1-33 (2008)Searching for Autarkies to Trim Unsatisfiable Clause Sets., and . SAT, volume 4996 of Lecture Notes in Computer Science, page 182-195. Springer, (2008)MaxSAT-Based MCS Enumeration., , and . Haifa Verification Conference, volume 7857 of Lecture Notes in Computer Science, page 86-101. Springer, (2012)Improved Design Debugging Using Maximum Satisfiability., , , , and . FMCAD, page 13-19. IEEE Computer Society, (2007)Smallest MUS Extraction with Minimal Hitting Set Dualization., , , and . CP, volume 9255 of Lecture Notes in Computer Science, page 173-182. Springer, (2015)Iterative and core-guided MaxSAT solving: A survey and assessment., , , , and . Constraints An Int. J., 18 (4): 478-534 (2013)