Knowledge compilation is a family of approaches for addressing the intractability of a number of artificial intelligence problems.
Different compiled representations have different properties. The three main properties are:
- The compactness of the representation
- The queries that are supported in polytime
- The transformations of the representations that can be performed in polytime
Classes of representations
Some examples of diagram classes include OBDDs, FBDDs, and non-deterministic OBDDs, as well as MDD.
Examples of circuit classes include NNF, DNNF, d-DNNF, and SDD.
- Adnan Darwiche, Pierre Marquis, "A Knowledge Compilation Map", Journal of Artificial Intelligence Research 17 (2002) 229-264