Evènement pour le groupe Modélisation et Verification

Date 2013-12-05  11:00-12:00
TitreKnowledge Compilation for Model Counting: Affine Decision Trees 
RésuméCounting the models of a propositional formula is a key issue for many AI problems, but few propositional languages offer the possibility to count models efficiently. In order to fill the gap, we recently introduced the extended affine decision tree language (EADT). An extended affine decision tree simply is a tree with affine decision nodes and some specific decomposable conjunction or disjunction nodes. Unlike standard decision trees, the decision nodes of an EADT formula are not labeled by variables but by affine clauses. During this talk, a brief overview of the different compilation languages and their theoritical caracteristics will be done. Then, we will focus on EADT and several of its subsets regarding the knowledge compilation map. We also describe a CNF-to-EADT compiler and present some experimental results. 
OrateurJean-Marie Lagniez 

Aucun document lié à cet événement.

Retour à l'index