Jul 24, 2021   News Gilles Audemard receives CAV 2021 award

Gilles Audemard received with 20 other researchers on July 23, 2021 the 2021 award from the international conference on Computer-Aided Verification for pioneering contributions to the foundation of the theory and practice of Satisfiability Modulo Theory (SMT). ![]({{site.baseurl| append: “/documents/cavaward.jpg”}}) See the full announcement.

Aug 31, 2020   News An article co-authored by CRIL's members distinguished at ECAI'2020

The article by Zied Bouraoui, Jean-Marie Lagniez, Pierre Marquis et Valentin Montmirail titled Consolidating Modal Knowledge Bases has been distinguished at ECAI'2020.

May 28, 2020   News Publication of A Guided Tour of Artificial Intelligence Research

The three volumes of A Guided Tour of Artificial Intelligence Research have just been published by Springer

May 17, 2020   News Accepted papers at IJCAI'20

8 papers have been accepted from presentation at IJCAI conference (Yokohama, 2020)

Mar 13, 2020   News H2020 project TAILOR to build a European network of excellence in AI accepted

CRIL is one of the few French partners of the H2020 project called TAILOR, set up by the confederation of laboratories for AI research in Europe (CLAIRE) and proposed in response to the call ICT-48 RIA “Proposal on the Foundations of Trustworthy AI”, aimed at building a European network of excellence in AI. TAILOR stands for “Trustworthy AI Integrating Learning, Optimization and Reasoning”. The project which has just been accepted, brings together 55 partners (universities, research centers, industrial partners) from a wide range of countries across Europe.

Jun 13, 2019   News Accepted papers at IJCAI'19

3 papers will be presented at IJCAI (Macao, 2019)

Dec 17, 2018   News PhD defense of Marwa Harzi - An optimization based framework for routing and scheduling activities in healthcare emergency departments

December the 17th, 2018,9AM, salle des thèses at Faculté Jean Perrin. Résumé : In this thesis, we focus on the routing and scheduling activities of patients in the Healthcare Emergency Department while involving optimization tools. We address three categories of research questions. The first category includes question about patient flow to the Emergency department. In this part we focuses on patient transportation problem derived from emergency medical services (EMS). Ambulance routing problem is a significant challenge.

Dec 17, 2018   News PhD defense of Imen Ouled Dlala - Declarative Approaches for Mining Frequent Itemsets over Transactional Databases

December the 17th, 2018, 2PM, salle des thèses at Faculté Jean Perrin. Abstract: La fouille de données est une étape primordiale du processus d’extraction de connaissances à partir des données. Elle a pour but d’analyser de grandes quantités de données afin de découvrir des connaissances. L’extraction des itemsets fréquents à partir d’une base de données transactionnelle est l’une des tâches principales de la fouille de données, qui consiste à identifier divers types de motifs afin de répondre aux besoins des utilisateurs ou des applications.

Dec 7, 2018   News PhD defense of Yacine Izza - Informatique ubiquitaire : techniques du curage d'informations perverties

December the 7th, 2018, 10h30, salle des thèses at Faculté Jean Perrin. Abstract : This thesis studies a possible approach of artificial intelligence for detecting and filtering inconsistent information in knowledge bases of intelligent objects and components in ubiquitous computing. This approach is addressed from a practical point of view in the SAT framework;it is about implementing a techniques of filtering inconsistencies in contradictory bases. Several contributions are made in this thesis.

Dec 6, 2018   News HDR defense of Saïd Jabbour

December the 6th, 2018, 2PM, salle des thèses at Faculté Jean Perrin. Abstract: Mes travaux de recherche sont à la frontière de plusieurs domaines incluant l’Intelligence Artificielle (IA) symbolique, la fouille de données, les graphes et les systèmes d’information. Ils se répartissent autour des mots clés suivants : raisonnement par contraintes, représentation des connaissances, modélisation des raisonnements, fouille de motifs sous contraintes, clustering, détection de communautés, compression de données et composition de services web.

Dec 3, 2018   News PhD defense of Nizar Mhadhbi

December the 3rd, 2018, 2PM, salle des thèses at Faculté Jean Perrin. Abstract : This thesis focuses on the field of complex networks analysis. A complex network can be defined as a system of interacting entities often represented by a graph. Two problems related to the study of large networks are addressed in this thesis. Our first goal is to extract relevant knowledge in graphs by identifying community structures. The second problem related to big graphs summarization.

Oct 26, 2018   News Temporary Engineer and Research positions available

In the context of “CPER DATA”, CRIL is looking for a research engineer and a researcher. The positions are advertised on emploi.cnrs.fr Research Engineer (12 months) Researcher (12 months)

Oct 11, 2018   News Daniel Le Berre awarded CNRS Innovation medal

Daniel Le Berre has been awarded on Wednesday October 10, 2018, the CNRS innovation medal, handed in by Higher Education, Research and Innovation minister Frédérique Vidal and CNRS CEO Antoine Petit, for the development of the Sat4j open source library and its integration in the open platform Eclipse. ![Medal ceremony 2018/10/10]({{site.baseurl| append: “/documents/remisemedaille.jpg”}}) Awarded by the CNRS since 2011, this prize rewards researchers for their outstanding work in the technological, therapeutic or social fields.

Sep 17, 2018   News PhD defense of Valentin Montmirail - Practical resolution of satisfiability testing for modal logics

September 17th, 2018, 10 AM, salle des thèses de la faculté Jean Perrin Abstract In this thesis, we explored the idea to use modern SAT technology that has seen considerable progress over the last years for solving various kinds of Modal Logics. We tackled the problem from various directions. For the NP-complete variants of Modal Logics it is a natural choice to encode them to SAT and use a SAT solver to decide them.

Sep 13, 2018   News PhD defense of Abdelhamid Boudane - Constraints Based Data Mining

September 13th, 2018, 2 PM, salle des thèses de la faculté Jean Perrin Abstract In this thesis, We adress the well-known clustering and association rules mining problems. Our first contribution introduces a new clustering framework, where complex objects are described by proposi- tional formulas. First, we extend the two well-known k-means and hierarchical agglomerative clustering techniques to deal with these complex objects. Second, we introduce a new divisive algorithm for clus- tering objects represented explicitly by sets of models.

Jul 26, 2018   News Accepted papers at KR'18

4 papers et 3 extended abstracts accepted to KR conference (Tempe, Arizona, 2018)

Jun 9, 2018   News Ivan Varzinczak to receive Louis Couturat's logic prize

Ivan Varzinczak will receive Louis Couturat’s logic prize during the next edition of the UNILOG'18 conference, on June 24, for his article “A note on a description logic of concept and role typicality”.

May 16, 2018   News Accepted papers at IJCAI'18

7 papers will be presented at IJCAI (Stockholm, 2018)

Dec 12, 2017   News PhD defense of Nicolas Szczepanski - Parallel SAT solving

December 12, 2017, 10am, salle des thèses de la faculté Jean Perrin Summary: This thesis deals with propositional satisfiability ( SAT ) in a massively parallel setting. The SAT problem is widely used for solving several combinatorial problems (e.g. formal verification of hardware and software, bioinformatics, cryptography, planning, scheduling, etc.). The first contribution of this thesis concerns the design of efficient algorithms based on the approaches « portfolio » and « divide and conquer ».

Dec 12, 2017   News PhD defense of Jérôme Delobelle - Ranking-based Semantics for Abstract Argumentation

Decembre 12, 2017, 2:30pm, salle des thèses de la faculté Jean Perrin Summary: Dung’s theory of abstract argumentation is a formalism that represents conflicting information using an argumentation framework. Extension-based semantics have been introduced to determine, given an argumentation framework, the justifiable points of view on the acceptability of the arguments. However, these semantics are not appropriate for some applications. So alternative semantics, called ranking-based semantics, have recently been evolved. Such semantics produces, for a given argumentation framework, a ranking on its arguments from the most acceptable to the least one(s).

Dec 8, 2017   News PhD defense of Amélie Levray - Interval-based possibility theory: Conditioning and probability/possibility transformations

December 8, 2017, 2pm, salle des thèses, faculté Jean Perrin Summary: This thesis contributes to the development of efficient formalisms to handle uncertain information. Existing formalisms such as probability theory or possibility theory are among the most known and used settings to represent such information. Extensions and generalizations (e.g. imprecise probability theory, interval-based possibility theory) have been provided to handle uncertainty such as incomplete and ill-known knowledge and reasoning with the knowledge of a group of experts.

May 17, 2017   News Accepted papers at IJCAI'17

8 papers to be presented at IJCAI this year (Melbourne, 2017)

Dec 13, 2016   News PhD defense of Thomas Caridroit - Belief change and modal logics

December 13, 2016, 2pm, amphitheatre S25, faculty of science Summary Belief change is about finding appropriate ways to evolve an agent’s beliefs when confronted with new pieces of information. In most works on belief revision, the set of beliefs of an agent is composed of beliefs about the environment (the world) and is represented by a set of formulas of classical logic. In many applications, an agent is not alone in the environment, but sharing with other agents, which also have beliefs.

Dec 9, 2016   News PhD defense of Eric Piette - A new approach to constraints-based General Game Playing

Decembre 9, 2016, 2pm, amphithéatre S25, faculté Jean Perrin Summary : The ability for a computer program to effectively play any strategic game, often referred to General Game Playing (GGP), is a key challenge in AI. The GGP competitions, where any game is represented according to a set of logical rules in the Game Description Language (GDL), have led researches to compare various approaches, including Monte Carlo methods, automatic constructions of evaluation functions, logic programming, and answer set programming through some general game players.

Dec 8, 2016   News Joint Franco-Japanese seminar

CRIL will host from December 7 to December 9 colleagues from japanese research institutes. A seminar will take place on December 8.

Sep 21, 2016   News Uncertain Reasoning (UR) special track at the 30th International FLAIRS Conference (UR17)

The 30th international FLAIRS conference will take place in Marco Island, Florida, on May 22-24, 2017. CRIL members are involved in the program committee of the Uncertain Reasoning special track.

Sep 20, 2016   News 30th International Conference on Industrial, Engineering, Other Applications of Applied Intelligent Systems

The IEA/AIE conference will take place next year in Arras, June 27 to 30. The conference program and the local organization are managed by CRIL members.

Aug 30, 2016   News Woodstock wins the General Game Playing international competition

CRIL artificial player, Woodstock, just won the General Game Playing 2016 international competition organized by stanford university on August 18 and 19, 2016.

Jun 19, 2016   News Papers accepted at ECAI'16

9 papers accepted at the European AI conference (ECAI, The Hague, 2016)

Jun 6, 2016   News Nanjing-Artois Computer Science Seminar

We are proud to host a research meeting in collaboration with our colleages from Nanjing University on June 6 and 7.

Apr 27, 2016   News Papers accepted at IJCAI'16

6 papers co-authored by CRIL's members have been accepted at IJCAI (New York, 2016)

Feb 22, 2016   News Six communications accepted at KR 2016

Six communications have just been accepted to the 15th international conference on Principles of Knowledge Representation and Reasoning (KR 2016). Jerome Delobelle, Adrian Haret, Sébastien Konieczny, Jean-Guy Mailly, Julien Rossit and Stefan Woltran Merging of Abstract Argumentation Frameworks Jean-Francois Condotta, Issam Nouaouri and Michael Sioutis A SAT Approach for Maximizing Satisfiability in Qualitative Spatial and Temporal Constraint Networks Leila Amgoud, Jonathan Ben-Naim, Dragan Doder and Srdjan Vesic Ranking Arguments With Compensation-Based Semantics Said Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais and Yakoub Salhi A MIS Partition Based Framework for Measuring Inconsistency Jean-Francois Condotta, Badran Raddaoui and Yakoub Salhi Quantifying Conflicts for Spatial and Temporal Information Jean-Francois Baget, Salem Benferhat, Zied Bouraoui, Madalina Croitoru, Mugnier Marie-Laure, Odile Papini, Swan Rocher and Karim Tabia A General Modifier-based Framework for Inconsistency-Tolerant Query Answering (short paper)

Jan 12, 2016   Guest(s) Visit of Takehide Soh (Kobe, Japan)

Takehide Soh, from Kobe University, Japan, will visit CRIL on January 12 and 13, 2016. Takehide Soh works on the resolution of constraints based problems by encoding into SAT. He is the author of the tools Scarab and Diet-Sugar.

Dec 4, 2015   News PhD thesis defense of Nebras Gharbi - On compressing and parallelizing Constraint Satisfaction Problems

On Friday December 4, 2015, 2pm. Thesis room, Faculty of science Jean Perrin. Abstract: Constraint Programming (CP) is a powerful paradigm used for modelling and solving combinatorial constraint problems that relies on a wide range of techniques coming from artificial intelligence, operational research, graph theory,…, etc. The basic idea of constraint programming is that the user expresses its constraints and a constraint solver seeks a solution. Constraint Satisfaction Problems (CSP), is a framework at the heart of CP problems.

Oct 26, 2015   News ACAI-2015

CRIL is organizing an ECCAI summer school on constraint solving techniques in AI in Lille.

Sep 30, 2015   News PhD thesis defense of Jean-Guy Mailly - Dynamic of argumentation frameworks

On Wednesday September 30, 2015, 2pm. Thesis room, Faculty of science Jean Perrin. Abstract: This thesis aims at studying new scenarios of the dynamics of argumentation frameworks. Our contribution is manyfold. First, we have been interested in the use of the well known AGM framework for belief change, originally defined for logical settings. We have adapted the rationality postulates for belief revision in the argumentation setting, and we have defined some families of revision operators which satisfy these postulates.

Sep 30, 2015   News Glucose won the parallel track of the SAT Race 2015

The SAT solver Glucose was ranked first in the parallel track of the SAT Race 2015

Sep 29, 2015   News Workshop "Change in Argumentation" on September 29 and 30.

CRIL is organizing a workshop “Change in Argumentation” on September 29 and 30 at the faculty of science Jean Perrin. Argumentation is one of the main theoretical tools to reason with conflicting information. It is useful for instance for non-monotonic reasoning, decision making, negotiation, dialogue, and has applications in law and medecine. Several arguments settings exist, from purely abstract ones to logic-based ones. Whatever the setting gathering the information required for building the argumentation system is an expensive task.

Sep 17, 2015   News Thesis defense of Nicolas Schmidt: compilation of preferences - application to product configuration

On Wednesday September 17, 2015 at 11:20am in thesis defense room, Faculty of science Jean Perrin, Lens Abstract The different languages from the valued decision diagrams (VDD) family benefit from polynomial-time algorithms for some tasks of interest (such as optimization, global inverse consistency, inference) for which no polynomial-time algorithm exists (unless P = NP) when the input is a constraint network or a Bayesian network considered at start. In this talk, we focus on configuration product problems, and more specifically on-line configuration with an associated valuation function (typically, a price).

Jul 25, 2015   News CoQuiAAS got first place during the first argumentation competiton

Argumentation solver CoQuiAAS was ranked first during the first argumentation competition organized within the workshop Theory and Applications of Formal Arguments at IJCAI

Jun 11, 2015   News Journées des doctorants (JDD'15)

From 11 June to 12 June, the CRIL organizes the days of PhD students ( JDD - 2015). This year, the doctoral students will present their work in Fort- Mahon. Thursday, june 11 th E. Lonca : Multiobjective optimization : Complexity under compiled constraints and solving using SAT N. Gharbi : Constraint Solving using Parallel Singleton Arc Consistency E. Piette : General Game Playing with Stochastic CSP

Jun 1, 2015   News A New ECCAI Fellow at CRIL

Salem Benferhat became ECCAI Fellow in 2015

May 1, 2015   News Accepted Papers at IJCAI'15

6 papers accepted at IJCAI (Buenos Aires, 2015)

Jan 31, 2015   News Best Paper Award at ICAART 2015 for Srdjan Vesic

How to Decrease and Resolve Inconsistency of a Knowledge Base?