HORNSAT is a restricted version of the boolean satisfiability problem where all clauses are written in Horn normal form. The programming lanugage Prolog uses HORNSAT internally to solve many constraint problems. This modules implements Dowling and Gallier's linear time algorithm:
- Dowling W., Gallier J. "Linear time algorithms for testing the satisfiability of propositional Horn formulae" (1984) Journal of Logic Programming
This code should work both in node.js and in the browser via browserify.
var hornSAT =// Horn clauses are encoded as pairs. For example, the clause:// (x1 & x2 => x3)// Becomes:// [ [0,1], 2 ]// For clauses that map to false, use -1 for the head of the clause:// (x1 => 0)// Becomes:// [, -1]////// For example, let's solve the problem://// x1 & (x1 & x3 => x2) & (x1 => x2) & (x1 & x2 & x3 => 0) & (x1 & x3 & x4 => 0) & (x3 & x2 => x4) & (x4 & x5 => 0)//console// Prints out://// [ true, true, false, false, false ]//
npm install horn-sat
Finds a satisfying assignment of variables to the HORNSAT instance
numVariablesis the number of variables in the problem
clausesis an array of clauses, encoded as described in the example
Returns An assignment of variables that solves the Horn SAT instance, or else
false if the problem is not satisfiable.
(c) 2013 Mikola Lysenko. MIT License