Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations

DOI10.1093/logcom/exac004OpenAlexW4213277490MaRDI QIDQ5044548

Javier Larrosa, Emma Rollon

Publication date: 1 November 2022

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exac004

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

This page was built for publication: Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations