Covered clauses are not propagation redundant
From MaRDI portal
Publication:2096437
Cites work
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- Blocked clause elimination
- Bounded model checking using satisfiability solving
- Clause elimination for SAT and QSAT
- Clause elimination procedures for CNF formulas
- Computer-aided proof of Erdős discrepancy properties
- DRAT proofs, propagation redundancy, and extended resolution
- Encoding Redundancy for Satisfaction-Driven Clause Learning
- scientific article; zbMATH DE number 3930351 (Why is no real title available?)
- scientific article; zbMATH DE number 3988706 (Why is no real title available?)
- Incremental inprocessing in SAT solving
- Inprocessing rules
- On a generalization of extended resolution
- Short proofs without new variables
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Strong extension-free proof systems
- Super-blocked clauses
- The complexity of facets (and some facets of complexity)
- The complexity of the pigeonhole principle
- The intractability of resolution
- Truth assignments as conditional autarkies
- What a difference a variable makes
Cited in
(4)
Describes a project that uses
Uses Software
This page was built for publication: Covered clauses are not propagation redundant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096437)