Knowledge compilation

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Diego Moya (talk | contribs) at 17:45, 9 April 2023 (Explain WP:JARGON). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 models exist.[1]

Different compiled representations have different properties. The three main properties are:

  • The compactness of the representation
  • The queries that are supported in polynomial time
  • The transformations of the representations that can be performed in polynomial time

Classes of representations

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.

References

  1. ^ Adnan Darwiche, Pierre Marquis, "A Knowledge Compilation Map", Journal of Artificial Intelligence Research 17 (2002) 229-264


Stub icon

This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Knowledge_compilation&oldid=1149016152"