Automatic Generation of Propagation Complete SAT Encodings

DOI10.1007/978-3-662-49122-5_26zbMath1475.68218OpenAlexW2402150566MaRDI QIDQ2796076

Liana Hadarean, Ruben Martins, Martin Brain, Daniel Kroening

Publication date: 23 March 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:a0288804-7811-4e1a-84f2-8972e6960040

Mathematics Subject Classification ID

Computational aspects of satisfiability (68R07)

Related Items (4)

Abstract interpretation as automated deduction ⋮ Learning a propagation complete formula ⋮ A lower bound on CNF encodings of the at-most-one constraint ⋮ Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers

This page was built for publication: Automatic Generation of Propagation Complete SAT Encodings