On approximate knowledge compilation with weighted decision diagrams

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

Computational efficiency is a central concern in the design of knowledge representation systems. Despite the tremendous progress in developing solution techniques for dealing with large constraint satisfaction problems, there will be always problems that are too large for the very powerful techniques. Decision Diagrams (DDs) is one of the standard approaches for representing a problem in a more compact way. In this paper we propose an approach for approximate knowledge compilation with Weighted Decision Diagrams.

Original languageEnglish
Title of host publicationProceedings of the 2007 International Conference on Artificial Intelligence, ICAI 2007
Pages470-475
Number of pages6
Publication statusPublished - 2007
Event2007 International Conference on Artificial Intelligence, ICAI 2007 - Las Vegas, NV, United States
Duration: 25 Jun 200728 Jun 2007

Publication series

NameProceedings of the 2007 International Conference on Artificial Intelligence, ICAI 2007
Volume2

Conference

Conference2007 International Conference on Artificial Intelligence, ICAI 2007
Country/TerritoryUnited States
CityLas Vegas, NV
Period25/06/0728/06/07

Keywords

  • Approximate compilation
  • Constraint satisfaction problem
  • Weighted decision diagrams

Fingerprint

Dive into the research topics of 'On approximate knowledge compilation with weighted decision diagrams'. Together they form a unique fingerprint.

Cite this