Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

BIRTHDAY

2008

Springer

2008

Springer

The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision Diagram (AOMDD) augments well known decision diagrams (OBDDs, MDDs) with AND nodes, in order to capture function decomposition structure. The AOMDD is based on a pseudo tree of the network, rather than a linear ordering of its variables. The AOMDD of a constraint network is a canonical form given a pseudo tree. We describe two main approaches for compiling the AOMDD of a constraint network. The first is a top down, search-based procedure, that works by applying reduction rules to the trace of the memory intensive AND/OR search algorithm. The second is a bottom up, inference-based procedure, that uses a Bucket Elimination schedule. For both algorithms, the compilation time and the size of the AOMDD are, in the worst case, exponential in the treewidth of the constraint graph, rather than pathwidth as is known ...

Related Content

Added |
12 Oct 2010 |

Updated |
12 Oct 2010 |

Type |
Conference |

Year |
2008 |

Where |
BIRTHDAY |

Authors |
Robert Mateescu, Rina Dechter |

Comments (0)