From post

Unifying Reasoning and Core-Guided Search for Maximum Satisfiability.

, и . JELIA, том 11468 из Lecture Notes in Computer Science, стр. 287-303. Springer, (2019)

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.

 

Другие публикации лиц с тем же именем

Preprocessing in Incomplete MaxSAT Solving., , и . ECAI, том 325 из Frontiers in Artificial Intelligence and Applications, стр. 347-354. IOS Press, (2020)Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization., , , и . CP, том 280 из LIPIcs, стр. 18:1-18:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Pseudo-Boolean Optimization by Implicit Hitting Sets., , и . CP, том 210 из LIPIcs, стр. 51:1-51:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm., , и . ACM J. Exp. Algorithmics, 24 (1): 1.9:1-1.9:19 (2019)Refined Core Relaxation for Core-Guided MaxSAT Solving., , и . CP, том 210 из LIPIcs, стр. 28:1-28:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Enumerating Potential Maximal Cliques via SAT and ASP., , и . IJCAI, стр. 1116-1122. ijcai.org, (2019)Abstract Cores in Implicit Hitting Set MaxSat Solving., , и . SAT, том 12178 из Lecture Notes in Computer Science, стр. 277-294. Springer, (2020)Core-Guided and Core-Boosted Search for CP., , , и . CPAIOR, том 12296 из Lecture Notes in Computer Science, стр. 205-221. Springer, (2020)Certified Core-Guided MaxSAT Solving., , , , и . CADE, том 14132 из Lecture Notes in Computer Science, стр. 1-22. Springer, (2023)Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization., , и . SAT, том 236 из LIPIcs, стр. 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)