Pierre Marquis – Compiling Propositional Formulae into Decision-DNNF Representations

Jeudi 23 janvier 2020 de 14h00 à 15h30.

Amphi Inria – Bâtiment B – Rue Héloïse à Villeneuve d’Ascq – Haute Borne.

Abstract :

Knowledge compilation (KC) is a research area which aims to preprocess information to improve the time required to solve highly-demanding computational tasks (NP and Beyond NP problems). Pioneered more than two decades ago, KC is nowadays a very active field, being at the intersection of several areas of AI and computer science. This includes knowledge representation, tractable reasoning,  algorithms, complexity theory and databases. As a result, KC is now providing a meeting point for several active research areas, while offering great potential for new synergies and advancements.
In this talk, after an introduction to knowledge compilation, I will focus on the language of Decision-DNNF representations that is often used as a target language for compiling propositional formulae. I will explain why this language is appealing and present some compilation algorithms for generating Decision-DNNF representations.

Short bio : Pierre Marquis hold a faculty position at Université d’Artois. he is the head of the CRIL lab since September 2018.

Les commentaires sont fermés.