| Home |
| About |
| Submission |
| Updating Entries |
| Using Entries |
| Search |
| Statistics |
| Index |
| Download |
A Fast SAT Solver for Isabelle in Standard ML
| Title: | A Fast SAT Solver for Isabelle in Standard ML |
| Author: | Armin Heller |
| Submission date: | 2009-12-09 |
| Abstract: | This contribution contains a fast SAT solver for Isabelle written in Standard ML. By loading the theory DPT_SAT_Solver, the SAT solver installs itself (under the name ``dptsat'') and certain Isabelle tools like Refute will start using it automatically. This is a port of the DPT (Decision Procedure Toolkit) SAT Solver written in OCaml. |
| BibTeX: |
@article{DPT-SAT-Solver-AFP,
author = {Armin Heller},
title = {A Fast SAT Solver for Isabelle in Standard ML},
journal = {Archive of Formal Proofs},
month = dec,
year = 2009,
note = {\url{http://isa-afp.org/entries/DPT-SAT-Solver.html},
Formal proof development},
ISSN = {2150-914x},
}
|
| License: | BSD License |
| Status: [ok] | This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |