No article text was recorded for this version.
redundancy in SAT problems
Version 1 of 17 papers25 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Accelerating SAT Solving by Common Subclause Elimination
- Blog: An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers
- Blog: Reduced Cost Fixing for Maximum Satisfiability
- Blog: Redundancy in Random SAT Formulas
- Blog: Learning Shorter Redundant Clauses in SDCL Using MaxSAT
- Blog: Improving and Understanding the Power of Satisfaction-Driven Clause Learning
- Blog: Analysis of Core-Guided MaxSat Using Cores and Correction Sets
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_redundancy_in_sat_problems_622395ca,
title = {redundancy in SAT problems},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/redundancy-in-sat-problems/rdr_622395ca91524d56bd6ba8539f71afbf},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_redundancy_in_sat_problems_622395ca_v1,
title = {redundancy in SAT problems},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/redundancy-in-sat-problems/rdr_622395ca91524d56bd6ba8539f71afbf/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}