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. [1]
Different compiled representations have different properties. The three main properties are:
Some examples of diagram classes include OBDDs, FBDDs, and non-deterministic OBDDs, as well as MDD.
Some examples of formula classes include DNF and CNF.
Examples of circuit classes include NNF, DNNF, d-DNNF, and SDD.