@aureooms/js-sat

Boolean formula satisfiability algorithms for JavaScript. See docs. Parent is @aureooms/js-algorithms. For a polynomial time algorithm for the 2SAT problem see @aureooms/js-2sat.
let instance = satfrom ;// or// let instance = sat.from.keys(// [// [ [ false , '1' ] , [ true , '2' ] , [ true , '3' ] ] ,// [ [ false , '2' ] , [ false , '4' ] , [ true , '5' ] ] ,// [ [ true , '1' ] , [ false , '5' ] ]// ]// ) ;sat ; // truesat ; // truefor let certificate of sat console ;