Author of the publication

New & improved models for SAT-based bi-decomposition.

, and . ACM Great Lakes Symposium on VLSI, page 141-146. ACM, (2012)

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

cmMUS: A Tool for Circumscription-Based MUS Membership Testing., and . LPNMR, volume 6645 of Lecture Notes in Computer Science, page 266-271. Springer, (2011)Assessing Heuristic Machine Learning Explanations with Model Counting., , , , and . SAT, volume 11628 of Lecture Notes in Computer Science, page 267-278. Springer, (2019)Quantified Maximum Satisfiability: - A Core-Guided Approach., , and . SAT, volume 7962 of Lecture Notes in Computer Science, page 250-266. Springer, (2013)SAT in Bioinformatics: Making the Case with Haplotype Inference., and . SAT, volume 4121 of Lecture Notes in Computer Science, page 136-141. Springer, (2006)Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing., , and . SAT, volume 9340 of Lecture Notes in Computer Science, page 324-342. Springer, (2015)Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription., , and . JELIA, volume 6341 of Lecture Notes in Computer Science, page 195-207. Springer, (2010)Literal-Based MCS Extraction., , and . IJCAI, page 1973-1979. AAAI Press, (2015)New & improved models for SAT-based bi-decomposition., and . ACM Great Lakes Symposium on VLSI, page 141-146. ACM, (2012)SMT-Based Bounded Model Checking for Embedded ANSI-C Software., , and . IEEE Trans. Software Eng., 38 (4): 957-974 (2012)Computing Minimal Sets on Propositional Formulae I: Problems & Reductions., and . CoRR, (2014)