Preprocessing of propagation redundant clauses
type: Item
instance of: scholarly article
title: Preprocessing of propagation redundant clauses
DOI: 10.1007/978-3-031-10769-6_8
author: Joseph E. Reeves
author: Marijn J. H. Heule
author: Randal E. Bryant
publication date: 2022-12-07T00:00:00Z
Mathematics Subject Classification ID: 68V15
zbMATH DE Number: 7628184
describes a project that uses: CaDiCaL
describes a project that uses: MiniSat
describes a project that uses: SaDiCaL
describes a project that uses: Chaff
describes a project that uses: DRAT-trim
MaRDI profile type: Publication
full work available at URL: 978-3-031-10769-6 8
OpenAlex ID: W4289104012
cites work: Mutilated chessboard problem is exponentially hard for resolution
cites work: Community Structure in Industrial SAT Instances
cites work: Narrow Proofs May Be Maximally Long
cites work: Evaluating CDCL Variable Scoring Schemes
cites work: Improved Static Symmetry Breaking for SAT
cites work: Theory and Applications of Satisfiability Testing
cites work: The intractability of resolution
cites work: Expressing Symmetry Breaking in DRAT Proofs
cites work: Short proofs without new variables
cites work: Strong extension-free proof systems
cites work: Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
cites work: Inprocessing Rules
cites work: Non-uniqueness of minimal superpermutations
cites work: Super-Blocked Clauses
cites work: Learning Rate Based Branching Heuristic for SAT Solvers
cites work: \texttt{cake\_lpr}: verified propagation redundancy checking in CakeML
cites work: DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
Recommended article: Preprocessing of propagation redundant clauses
Recommended article: Clause redundancy and preprocessing in maximum satisfiability
Recommended article: Q3491011
Recommended article: How to avoid the derivation of redundant clauses in reasoning systems
Recommended article: Propagation via lazy clause generation
Recommended article: Q3837994
Recommended article: Covered clauses are not propagation redundant
Recommended article: Eliminating Redundant Clauses in SAT Instances
Recommended article: Recognizing unnecessary clauses in resolution based systems
description: scientific article; zbMATH DE number 7628184