Equivalent literal propagation in the DLL procedure
type: Item
instance of: scholarly article
title: Equivalent literal propagation in the DLL procedure
zbMATH Open document ID: 1029.68080
DOI: 10.1016/S0166-218X(02)00407-9
author: Chu-Min Li
published in: Discrete Applied Mathematics
publication date: 2003-09-15T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1981510
zbMATH Keywords: Davis-Logemann-Loveland procedure
zbMATH Keywords: Equivalency reasoning
zbMATH Keywords: SAT
describes a project that uses: Chaff
describes a project that uses: SatEx
describes a project that uses: SATO
describes a project that uses: ZRes
describes a project that uses: DIMACS
describes a project that uses: HeerHugo
MaRDI profile type: Publication
cites work: Q4817533
cites work: Q2723442
cites work: The complexity of theorem-proving procedures
cites work: Q3619797
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Explicit constructions of linear-sized superconcentrators
cites work: The propositional formula checker HeerHugo
cites work: Exploiting the real power of unit propagation lookahead
cites work: Q4473057
cites work: Principles and Practice of Constraint Programming – CP 2003
cites work: SatEx: A web-based framework for SAT experimentation
cites work: Q5593816
cites work: Hard examples for resolution
cites work: Q5687274
cites work: A two-phase algorithm for solving a class of hard satisfiability problems
cites work: SATO: An efficient propositional prover
description: scientific article; zbMATH DE number 1981510