Lectures on Knowledge Representation and Reasoning (AI)
We would like to kindly invite you to join us at Special Guest Lectures on Knowledge Representation and Reasoning by three world-leading researchers, Pierre Marquis, Sébastien Konieczny and Jean-Marie Lagniez, from Centre de Recherche en Informatique de Lens (CRIL), France.
Anyone is welcome to attend.
June 12 (Tue.)
National Institute of Informatics
Room 1509, 15th floor
15:00 - 15:40
Sébastien Konieczny: "coscinus.org: A tool for computing and representing computer science conference closeness"
Abstract: We will present the coscinus tool, that computes the closeness between publication supports using the co-publication habits of authors: the more authors publish in two conferences, the closer these two conferences. Then we use principal components analysis and clustering performed on this closeness relation. This allows us to extract interesting information on conferences and on communities closeness.
A part of this work will be presented at IJCAI-18 as the paper "Artificial Intelligence Conferences Closeness" (joint work with Emmanuel Lonca).
15:40 - 16:20
Pierre Marquis: "DMC: A Distributed Model Counter"
Abstract: We present and evaluate DMC, a distributed model counter for propositional CNF formulae based on the state-of-the-art sequential model counter D4. DMC can take advantage of a (possibly large) number of sequential model counters running on (possibly heterogeneous) computing units spread over a network of computers. For ensuring an efficient workload distribution, the model counting task is shared between the model counters following a policy close to work stealing.
The number and the sizes of the messages which are exchanged by the jobs are kept small. The results obtained show DMC as a much more efficient counter than D4, the distribution of the computation yielding large improvements for some benchmarks. This work will be presented at IJCAI-18 as joit work with Jean-Marie Lagniez and Nicolas Szczepanski.
16:20 - 17:00
Jean-Marie Lagniez: "Boosting MCSes Enumeration"
Abstract: The enumeration of all Maximal Satisfiable Subsets (MSSes) or all Minimal Correction Subsets (MCSes) of an unsatisfiable CNF Boolean formula is a useful and sometimes necessary step for solving a variety of important AI issues. Although the number of different MCSes of a CNF Boolean formula is exponential in the worst case, it remains low in many practical situations; this makes the tentative enumeration possibly successful in these latter cases. In the paper, a technique is introduced that boosts the currently most efficient practical approaches to enumerate MCSes. It implements a model rotation paradigm that allows the set of MCSes to be computed in an heuristically efficient way.
This work will be presented at IJCAI-18 as joint work with Éric Grégoire and Yacine Izza.
- Sebastien Konieczny is a CNRS Professor and a Co-Leader of the research axis "Knowledge Representation and Reasoning" at CRIL.
- Pierre Marquis is a Professor of Computer Science, Université d'Artois and is a Delegate Director of CRIL.
- Jean-Marie Lagniez is an Associate Professor of IUT de Lens,Université d'Artois and is a member of the research axis "Algorithms for Inference and Constraints" at CRIL.
Katsumi Inoue < inoue [at] nii.ac.jp >