Towards a better understanding of (partial weighted) MaxSAT proof systems
From MaRDI portal
Publication:2661348
DOI10.1007/978-3-030-51825-7_16OpenAlexW3009857076MaRDI QIDQ2661348
Publication date: 7 April 2021
Full work available at URL: https://arxiv.org/abs/2003.02718
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Related Items (5)
MaxSAT resolution for regular propositional logic ⋮ Circular (Yet Sound) Proofs in Propositional Logic ⋮ Proofs and Certificates for Max-SAT ⋮ MaxSAT Resolution and Subcube Sums ⋮ A proof builder for Max-SAT
This page was built for publication: Towards a better understanding of (partial weighted) MaxSAT proof systems