2 Propositionalized constraints have previously been used with integer linear programming (ILP) using binary {0, 1} values corresponding to {f alse, true}, to find an (exact) consistent truth assignment minimizing some cost and solve a global inference problem, e.g.
without prior knowledge the fact-finders do very poorly against our test set of 694 British words, predicting American spelling instead in accordance with the great majority of authors (note that accuracy from an American perspective is 1−"British" accuracy).