Equivalence between systems stronger than resolution

DOI10.1007/978-3-030-51825-7_13OpenAlexW3039645805MaRDI QIDQ2661345

Maria Luisa Bonet, Jordi Levy

Publication date: 7 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-51825-7_13

Mathematics Subject Classification ID

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: Equivalence between systems stronger than resolution