Knowledge compilation is a family of approaches for addressing the intractability of a number of artificial intelligence problems.
A propositional model is compiled in an off-line phase in order to support some queries in polynomial time.
Many ways of compiling a propositional model exist.
Some examples of formula classes include DNF and CNF.
Examples of circuit classes include NNF, DNNF, d-DNNF, and SDD.