2002/09/01 by A. Darwiche, P. Marquis · 2 citations
Computer Science · #Advanced Database Systems and Queries #Model-Driven Software Engineering Techniques #Semantic Web and Ontologies #cs.AI
paper · pdf · doi:10.1613/jair.989
published as Journal Of Artificial Intelligence Research, Volume 17, pages 229-264, 2002
openalex publication_date 2002/09/01 · arxiv created 2011/06/09 · arxiv updated 2011/06/10 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compilation language, and the class of queries and transformations that the language supports in polytime. We then provide a knowledge compilation map, which analyzes a large number of existing target compilation languages according to their succinctness and their polytime transformations and queries. We argue that such analysis is necessary for placing new compilation approaches within the context of existing ones. We also go beyond classical, flat target compilation languages based on CNF and DNF, and consider a richer, nested class based on directed acyclic graphs (such as OBDDs), which we show to include a relatively large number of target compilation languages.