Author of the publication

Pseudo-Boolean Optimization by Implicit Hitting Sets.

, , and . CP, volume 210 of LIPIcs, page 51:1-51:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

Preprocessing Argumentation Frameworks via Replacement Patterns., , , , and . JELIA, volume 11468 of Lecture Notes in Computer Science, page 116-132. Springer, (2019)MaxSAT-Based Cutting Planes for Learning Graphical Models., , and . CPAIOR, volume 9075 of Lecture Notes in Computer Science, page 347-356. Springer, (2015)SAT-based Judgment Aggregation., , and . AAMAS, page 1412-1420. ACM, (2023)Learning Chordal Markov Networks via Stochastic Local Search., , and . ECAI, volume 325 of Frontiers in Artificial Intelligence and Applications, page 2632-2639. IOS Press, (2020)Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper)., and . CP, volume 210 of LIPIcs, page 8:1-8:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Refined Core Relaxation for Core-Guided MaxSAT Solving., , and . CP, volume 210 of LIPIcs, page 28:1-28:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Enumerating Potential Maximal Cliques via SAT and ASP., , and . IJCAI, page 1116-1122. ijcai.org, (2019)Controllability of Control Argumentation Frameworks., , and . IJCAI, page 1855-1861. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Certified MaxSAT Preprocessing., , , , , and . CoRR, (2024)Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability., , and . AISTATS, volume 33 of JMLR Workshop and Conference Proceedings, page 86-95. JMLR.org, (2014)