A Theory of Satisfiability-Preserving Proofs in SAT Solving

DOI10.29007/tc7qzbMath1415.68203OpenAlexW2907057313MaRDI QIDQ5222981

Adrián Rebola-Pardo, Martin Suda

Publication date: 4 July 2019

Published in: EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.29007/tc7q

zbMATH Keywords

interferenceSAT solvinginprocessing techniques

Mathematics Subject Classification ID

Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Unnamed Item ⋮ Simulating strong practical proof systems with extended resolution

This page was built for publication: A Theory of Satisfiability-Preserving Proofs in SAT Solving