Paper Accepted in SoCS and CP

I am happy to let you know that our papers SLS-Enhanced Core-Boosted Linear Search for Anytime Maximum Satisfiability, From Scalable SAT to MaxSAT: Massively Parallel Solution Improving Search and Symmetric Core Learning for Pseudo-Boolean Optimization by Implicit Hitting Sets have been accepted at the The 18th International Symposium on Combinatorial Search and The 31st International Conference on Principles and Practice of Constraint Programming.

The papers describe a massively distributed search algorithm for Maximum Satisfiability, a method of incorporating symmetry reasoning in an implicit hitting set approach that does not decrease performance, and an empirical study of combining SLS methods with CDCL reasoning. I will link the papers to these pages after the conferences in August.

I want to thank all my co-authors for their outstanding work on the projects. I hope to meet many of you in Glasgow.