Preprocessing Boolean Formulae for BDDs in a Probabilistic Context

• Type: Article in International Conference Proceedings Book
• Date: 2010

Authors

Theofrastos Mantadelis (Author) Other; Ricardo Rocha (Author) FCUP; Angelika Kimmig (Author) Other; Gerda Janssens (Author) Other

Conference proceedings International

Title: LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2010

Pages: 260-272

12th European Conference on Logics in Artificial Intelligence (JELIA)

Helsinki, FINLAND, SEP 13-15, 2010

Indexing

ISI Web of Knowledge - 2 Citations

Scopus - 4 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

CORDIS: Physical sciences > Computer science

Other information

Authenticus ID: P-007-W2R

DOI: 10.1007/978-3-642-15675-5_23

Abstract (EN): Inference in many probabilistic logic systems is based on representing the proofs of a query as a DNF Boolean formula. Assessing the probability of such a formula is known as a #P-hard task. In practice, a large DNF is given to a BDD software package to construct the corresponding BDD. The DNF has to be transformed into the input format of the package. This is the preprocessing step. In this paper we investigate and compare different preprocessing methods, including our new trie based approach. Our experiments within the ProbLog system show that the behaviour of the methods changes according to the amount of sharing in the original DNF. The decomposition method is preferred when there is not much sharing in the DNF, whereas DNFs with sharing benefit from our trie based method. While our methods are motivated and applied in the ProbLog context, our results are interesting for other applications that manipulate DNF Boolean formulae.

Language: English

Type (Professor's evaluation): Scientific

Notes: Logics in Artificial Intelligence , Lecture Notes in Computer Science, 2010, Volume 6341/2010, 260-272, Springer-Verlag, DOI: 10.1007/978-3-642-15675-5_23

No. of pages: 13