Local Redundancy in SAT: Generalizations of Blocked Clauses

@article{Kiesl2018LocalRI,
  title={Local Redundancy in SAT: Generalizations of Blocked Clauses},
  author={Benjamin Kiesl and M. Seidl and H. Tompits and Armin Biere},
  journal={Log. Methods Comput. Sci.},
  year={2018},
  volume={14}
}
  • Benjamin Kiesl, M. Seidl, +1 author Armin Biere
  • Published 2018
  • Computer Science, Mathematics
  • Log. Methods Comput. Sci.
  • Clause-elimination procedures that simplify formulas in conjunctive normal form play an important role in modern SAT solving. Before or during the actual solving process, such procedures identify and remove clauses that are irrelevant to the solving result. These simplifications usually rely on so-called redundancy properties that characterize cases in which the removal of a clause does not affect the satisfiability status of a formula. One particularly successful redundancy property is that of… CONTINUE READING

    References

    SHOWING 1-10 OF 34 REFERENCES
    Super-Blocked Clauses
    • 13
    • PDF
    Blocked Clause Elimination
    • 123
    • PDF
    Clause Elimination for SAT and QSAT
    • 53
    • PDF
    Blocked Clause Decomposition
    • 14
    • PDF
    Using SAT in QBF
    • 51
    • PDF
    Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask)
    • 11
    • PDF
    Simulating Circuit-Level Simplifications on CNF
    • 50
    • PDF
    Towards Understanding and Harnessing the Potential of Clause Learning
    • 289
    • PDF
    Inprocessing Rules
    • 163
    • PDF