资源分类
》 资源 》论文》A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

2019-10-29 | |  169 |   110 |   0
Abstract We developed a formal framework for SAT solving using the Isabelle/HOL proof assistant. Through a chain of refinements, an abstract CDCL (conflictdriven clause learning) calculus is connected to a SAT solver that always terminates with correct answers. The framework offers a convenient way to prove theorems about the SAT solver and experiment with variants of the calculus. Compared with earlier verifications, the main novelties are the inclusion of the CDCL rules for forget, restart, and incremental solving and the use of refinement

上一篇：A SAT Approach to Branchwidth?

下一篇：Automated Conjecturing I: Fajtlowicz’s Dalmatian Heuristic Revisited (Extended Abstract)

用户评价
全部评价

热门资源

  • Regularizing RNNs...

    Recently, caption generation with an encoder-de...

  • Deep Cross-media ...

    Cross-media retrieval is a research hotspot in ...

  • Supervised Descen...

    Many computer vision problems (e.

  • Learning Expressi...

    Facial expression is temporally dynamic event w...

  • Attributed Graph ...

    Graph clustering is a fundamental task which di...