Ordered AND, OR-Decomposition and Binary-Decision Diagram

08/14/2012
by   Yong Lai, et al.
0

In the context of knowledge compilation (KC), we study the effect of augmenting Ordered Binary Decision Diagrams (OBDD) with two kinds of decomposition nodes, i.e., AND-vertices and OR-vertices which denote conjunctive and disjunctive decomposition of propositional knowledge bases, respectively. The resulting knowledge compilation language is called Ordered AND, OR-decomposition and binary-Decision Diagram (OAODD). Roughly speaking, several previous languages can be seen as special types of OAODD, including OBDD, AND/OR Binary Decision Diagram (AOBDD), OBDD with implied Literals (OBDD-L), Multi-Level Decomposition Diagrams (MLDD). On the one hand, we propose some families of algorithms which can convert some fragments of OAODD into others; on the other hand, we present a rich set of polynomial-time algorithms that perform logical operations. According to these algorithms, as well as theoretical analysis, we characterize the space efficiency and tractability of OAODD and its some fragments with respect to the evaluating criteria in the KC map. Finally, we present a compilation algorithm which can convert formulas in negative normal form into OAODD.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/16/2011

Reduced Ordered Binary Decision Diagram with Implied Literals: A New knowledge Compilation Approach

Knowledge compilation is an approach to tackle the computational intract...
research
10/24/2014

Augmenting Ordered Binary Decision Diagrams with Conjunctive Decomposition

This paper augments OBDD with conjunctive decomposition to propose a gen...
research
03/03/2023

Query Learning Algorithm for Ordered Multi-Terminal Binary Decision Diagrams

We propose a query learning algorithm for ordered multi-terminal binary ...
research
01/15/2014

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models

Inspired by the recently introduced framework of AND/OR search spaces fo...
research
03/09/2000

On the tractable counting of theory models and its application to belief revision and truth maintenance

We introduced decomposable negation normal form (DNNF) recently as a tra...
research
02/05/2021

A Link Diagram Visualizing Relations between Two Ordered Sets

This article provides a link diagram to visualize relations between two ...
research
12/07/2022

A Decision Diagram Operation for Reachability

Saturation is considered the state-of-the-art method for computing fixpo...

Please sign up or login with your details

Forgot password? Click here to reset