logic-classes-1.4.8: Framework for propositional and first order logic, theorem proving

Safe HaskellNone




toCNF :: (Monad m, FirstOrderFormula formula atom v, PropositionalFormula formula atom, Atom atom term v, AtomEq atom p term, Term term v f, Literal formula atom, Ord formula) => formula -> NormalT formula v term m CNFSource

toLiteral :: forall m lit. (Monad m, Negatable lit, Ord lit) => lit -> LiteralMapT lit m LiteralSource

Convert a [[formula]] to CNF, which means building a map from formula to Literal.