Formalization and implementation of modern SAT solvers
type: Item
instance of: scholarly article
title: Formalization and implementation of modern SAT solvers
zbMATH Open document ID: 1187.68557
author: Filip Marić
published in: Journal of Automated Reasoning
publication date: 2009-09-01T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 5600748
zbMATH Keywords: SAT solving
zbMATH Keywords: DPLL
zbMATH Keywords: software verification
zbMATH Keywords: algorithms
zbMATH Keywords: data structures
describes a project that uses: PicoSAT
describes a project that uses: SATO
describes a project that uses: Chaff
describes a project that uses: BerkMin
describes a project that uses: SAT Solver Verification
describes a project that uses: MiniSat
describes a project that uses: Archive Formal Proofs
MaRDI profile type: Publication
full work available at URL: s10817-009-9127-8
OpenAlex ID: W2021196646
cites work: Q5715680
cites work: Q4473048
cites work: The complexity of theorem-proving procedures
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: An axiomatic basis for computer programming
cites work: Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
cites work: Isabelle/HOL. A proof assistant for higher-order logic
cites work: Q4413894
cites work: Q4804883
DOI: 10.1007/S10817-009-9127-8
description: scientific article; zbMATH DE number 5600748