Even shorter proofs without new variables

DOI10.4230/LIPICS.SAT.2023.22MaRDI QIDQ6643102zbMATH OpenFDO

Authors Adrián Rebola-Pardo

Publication date 26 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SAT.2023.22

zbMATH Keywords

interferenceSAT solvingunsatisfiability proofsunsatisfiable cores

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: Even shorter proofs without new variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6643102)