Author of the publication

Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription.

, , and . JELIA, volume 6341 of Lecture Notes in Computer Science, page 195-207. Springer, (2010)

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

Auditing static machine learning anti-Malware tools against metamorphic attacks., , , and . Comput. Secur., (2021)Boolean Lexicographic Optimization., , , and . RCRA@CPAIOR, volume 616 of CEUR Workshop Proceedings, CEUR-WS.org, (2010)Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem., and . Fundam. Informaticae, 102 (3-4): 363-389 (2010)QBF-Based Boolean Function Bi-Decomposition, , and . CoRR, (2011)The Inadequacy of Shapley Values for Explainability., and . CoRR, (2023)New & improved models for SAT-based bi-decomposition., and . ACM Great Lakes Symposium on VLSI, page 141-146. ACM, (2012)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)