| HAL-Inria | Publications, software ... of Inria's scientists |
A Formally-Proven Algorithm for 2-Sat Problems
Abstract : This notes explains how an algorithm that checks the satisfiability of a set of two clause has been formalised in the Coq prover using the SSReflect extension.
Cited literature [4 references]
https://hal.inria.fr/hal-01095538
Contributor : Laurent Thery Connect in order to contact the contributor
Submitted on : Monday, December 15, 2014 - 5:25:14 PM
Last modification on : Thursday, January 20, 2022 - 5:30:46 PM
Long-term archiving on: : Monday, March 16, 2015 - 12:30:24 PM
Contributor : Laurent Thery Connect in order to contact the contributor
Submitted on : Monday, December 15, 2014 - 5:25:14 PM
Last modification on : Thursday, January 20, 2022 - 5:30:46 PM
Long-term archiving on: : Monday, March 16, 2015 - 12:30:24 PM
File
TwoSat.pdf
Files produced by the author(s)