HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A Knowledge Compilation Map for Ordered Real-Valued Decision Diagrams

Abstract : Valued decision diagrams (VDDs) are data structures that represent functions mapping variable-value assignments to non-negative real numbers. They prove useful to compile cost functions, utility functions, or probability distributions. While the complexity of some queries (notably optimization) and transformations (notably conditioning) on VDD languages has been known for some time, there remain many significant queries and transformations, such as the various kinds of cuts, marginalizations, and combinations, the complexity of which has not been identified so far. This paper contributes to filling this gap and completing previous results about the time and space efficiency of VDD languages, thus leading to a knowledge compilation map for real-valued functions. Our results show that many tasks that are hard on valued CSPs are actually tractable on VDDs.
Complete list of metadata

Contributor : Alexandre Niveau Connect in order to contact the contributor
Submitted on : Monday, December 15, 2014 - 6:46:57 PM
Last modification on : Tuesday, March 22, 2022 - 8:41:23 AM


  • HAL Id : hal-01095571, version 1


Hélène Fargier, Pierre Marquis, Alexandre Niveau, Nicolas Schmidt. A Knowledge Compilation Map for Ordered Real-Valued Decision Diagrams. Twenty-Eighth AAAI Conference on Artificial Intelligence, Dec 2014, Québec, Canada. ⟨hal-01095571⟩



Record views