Knowledge compilation
 | This article needs attention from an expert in Computing. Please add a reason or a talk parameter to this template to explain the issue with the article. (March 2009) |
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 polytime. Many ways of compiling a propositional models exist.[1] Among others: NNF, DNNF, d-DNNF, BDD, SDD, MDD, DNF and CNF.
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
References
- ^ Adnan Darwiche, Pierre Marquis, "A Knowledge Compilation Map", Journal of Artificial Intelligence Research 17 (2002) 229-264
 | This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it. |