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

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

2011-03-16

arxiv.org/abs/1103.3123v2

Computer Science

Artificial Intelligence

18 pages, 13 figures

Scientific paper

Knowledge compilation is an approach to tackle the computational intractability of general reasoning problems. According to this approach, knowledge bases are converted off-line into a target compilation language which is tractable for on-line querying. Reduced ordered binary decision diagram (ROBDD) is one of the most influential target languages. We generalize ROBDD by associating some implied literals in each node and the new language is called reduced ordered binary decision diagram with implied literals (ROBDD-L). Then we discuss a kind of subsets of ROBDD-L called ROBDD-i with precisely i implied literals (0 \leq i \leq \infty). In particular, ROBDD-0 is isomorphic to ROBDD; ROBDD-\infty requires that each node should be associated by the implied literals as many as possible. We show that ROBDD-i has uniqueness over some specific variables order, and ROBDD-\infty is the most succinct subset in ROBDD-L and can meet most of the querying requirements involved in the knowledge compilation map. Finally, we propose an ROBDD-i compilation algorithm for any i and a ROBDD-\infty compilation algorithm. Based on them, we implement a ROBDD-L package called BDDjLu and then get some conclusions from preliminary experimental results: ROBDD-\infty is obviously smaller than ROBDD for all benchmarks; ROBDD-\infty is smaller than the d-DNNF the benchmarks whose compilation results are relatively small; it seems that it is better to transform ROBDDs-\infty into FBDDs and ROBDDs rather than straight compile the benchmarks.

Affiliated with

Also associated with

No associations

Rating

Reduced Ordered Binary Decision Diagram with Implied Literals: A New knowledge Compilation Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reduced Ordered Binary Decision Diagram with Implied Literals: A New knowledge Compilation Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduced Ordered Binary Decision Diagram with Implied Literals: A New knowledge Compilation Approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-262574