Certified Core-Guided MaxSAT Solving

Jeremias Berg, Bart Bogaerts, Jakob Nordström, Andy Oertel, Dieter Vandesande

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceedingPeer review

Sammanfattning

In the last couple of decades, developments in SAT-based optimization have led to highly efficient maximum satisfiability (MaxSAT) solvers, but in contrast to the SAT solvers on which MaxSAT solving rests, there has been little parallel development of techniques to prove the correctness of MaxSAT results. We show how pseudo-Boolean proof logging can be used to certify state-of-the-art core-guided MaxSAT solving, including advanced techniques like structure sharing, weight-aware core extraction and hardening. Our experimental evaluation demonstrates that this approach is viable in practice. We are hopeful that this is the first step towards general proof logging techniques for MaxSAT solvers.

Originalspråkengelska
Titel på värdpublikationAutomated Deduction – CADE 29 - 29th International Conference on Automated Deduction, Proceedings
RedaktörerBrigitte Pientka, Cesare Tinelli
FörlagSpringer Science and Business Media B.V.
Sidor1-22
Antal sidor22
ISBN (tryckt)9783031384981
DOI
StatusPublished - 2023
EvenemangProceedings of the 29th International Conference on Automated Deduction, CADE-29 - Rome, Italien
Varaktighet: 2023 juli 12023 juli 4

Publikationsserier

NamnLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volym14132 LNAI
ISSN (tryckt)0302-9743
ISSN (elektroniskt)1611-3349

Konferens

KonferensProceedings of the 29th International Conference on Automated Deduction, CADE-29
Land/TerritoriumItalien
OrtRome
Period2023/07/012023/07/04

Ämnesklassifikation (UKÄ)

  • Datavetenskap (datalogi)

Fingeravtryck

Utforska forskningsämnen för ”Certified Core-Guided MaxSAT Solving”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här