LIRICA : Logique, Interaction, Raisonnement et Inférence, Complexité, Algèbre

Mots clés

Logique, Raisonnements, Complexité, Représentation des Connaissance, Intelligence Artificielle, Sémantique, Théorie de la Preuve, Satisfiabilité des Formules

 

Responsable

Vincent RISCH

 
Membres

BENHAMOU Belaid  Enseignant-Chercheur / Chercheur
CREIGNOU Nadia  Enseignant-Chercheur / Chercheur
DALMONTE Tiziano  Doctorant
GRELLOIS Charles  Enseignant-Chercheur / Chercheur
KHALED Tarek  
NOUIOUA Farid  Enseignant-Chercheur / Chercheur
OLIVE Frederic  Enseignant-Chercheur / Chercheur
OLIVETTI Nicola  Enseignant-Chercheur / Chercheur
PAPINI Odile  Enseignant-Chercheur / Chercheur
RISCH Vincent  Enseignant-Chercheur / Chercheur
SABATIER Claude  Enseignant-Chercheur / Chercheur
SANTOCANALE Luigi  Enseignant-Chercheur / Chercheur
WURBEL Eric  Enseignant-Chercheur / Chercheur
YAHI Safa  Enseignant-Chercheur / Chercheur


 

Objectif scientifique

L’équipe LIRICA (Logique, Interaction, Raisonnement et Inférence, Complexité, Algèbre) s’inscrit dans les deux lignes de force du pôle Calcul du LIS : Logique et Méthodes Formelles d’une part, Intelligence Artificielle d’autre part. Nos recherches portent sur la formalisation de différents types de Raisonnement et d’Interactions, la théorie de la Complexité, les systèmes et outils Algébriques, ces trois axes s’enrichissant d’interactions multiples.

Axe 1. Représentation des connaissances et raisonnement en intelligence artificielle : utilisation de formalismes logiques pour le raisonnement et le traitement algorithmique des connaissances.

Axe 2. Complexité, théorie et applications : complexité structurelle, caractérisations de classes de complexité par des formalismes logiques, complexité de différentes classes de problèmes (SAT, model checking…), tâches algorithmiques (décision, comptage, énumération), et formalismes logiques.

Axe 3. Logiques non-classiques et modales, sémantique et théorie de la preuve : calculs déductifs, procédures de décision et leur automatisation, sémantiques alternatives et leurs propriétés algébriques.

 

Site Web

Nos séminaires : http://pageperso.lif.univ-mrs.fr/~luigi.santocanale/LIRICA/seminaire.xml

 

Projets en cours

  • ANR blanc AGGREG (2014-2019)
  • ANR PRCI TICAMORE (2017-2020)
  • projet mixte franco-algerien PHC Tassili (2017-2020)

 

Projets passés

  • ANR blanc ASPIQ (2012-2017)

 

Publications récentes de l’équipe



51 documents

Article dans une revue

  • Tiziano Dalmonte, Charles Grellois, Nicola Olivetti. Intuitionistic non-normal modal logics: A general framework. Journal of Philosophical Logic, Springer Verlag, In press. ⟨hal-02439704⟩
  • Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer. A Complexity Theory for Hard Enumeration Problems. Discrete Applied Mathematics, Elsevier, 2019, 268, pp.191-209. ⟨10.1016/j.dam.2019.02.025⟩. ⟨hal-02439418⟩
  • Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, et al.. Parameterised Enumeration for Modification Problems. Algorithms, MDPI, 2019, 12 (9), pp.189. ⟨10.3390/a12090189⟩. ⟨hal-02439368⟩
  • Silvio Ghilardi, Maria Joao Gouveia, Luigi Santocanale. Fixed-point elimination in the Intuitionistic Propositional Calculus (extended version). ACM Transactions on Computational Logic, Association for Computing Machinery, In press, 21 (1), pp.1--37. ⟨10.1145/3359669⟩. ⟨hal-01716485⟩
  • Ugo Dal Lago, Charles Grellois. Probabilistic Termination by Monadic Affine Sized Typing. ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2019, 41 (2), pp.1-65. ⟨10.1145/3293605⟩. ⟨hal-02399423⟩
  • Mourad Lassouaoui, Dalila Boughaci, Belaïd Benhamou. A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT. Intelligent Decision Technologies, 2019, pp.1-18. ⟨10.3233/IDT-180036⟩. ⟨hal-02098913⟩
  • Yasmine Lahsinat, Dalila Boughaci, Belaid Benhamou. Three local search meta-heuristics for the Minimum Interference Frequency Assignment Problem (MI-FAP) in cellular networks,. International Journal of Applied Metaheuristic Computing, In press. ⟨hal-02098923⟩
  • Silvio Ghilardi, Luigi Santocanale. Free Heyting Algebra Endomorphisms: Ruitenburg's Theorem and Beyond. Mathematical Structures in Computer Science, Cambridge University Press (CUP), In press. ⟨hal-01969235⟩
  • Yasmine Lahsinat, Dalila Boughaci, Belaïd Benhamou. Breakout variable neighbourhood search for the minimum interference frequency assignment problem. Journal of Systems and Information Technology, 2018, 20 (4), pp.468-488. ⟨10.1108/JSIT-10-2017-0094⟩. ⟨hal-02098915⟩
  • Luigi Santocanale. Embeddability into relational lattices is undecidable. Journal of Logical and Algebraic Methods in Programming, Elsevier, 2018, 97, pp.131-148. ⟨10.1016/j.jlamp.2018.03.001⟩. ⟨hal-01344299v3⟩
  • Nadia Creignou, Raïda Ktari, Odile Papini. Belief Update within Propositional Fragments. Journal of Artificial Intelligence Research, Association for the Advancement of Artificial Intelligence, 2018, 61, pp.807-834. ⟨10.1613/jair.5541⟩. ⟨hal-02077672⟩
  • Laura Giordano, Valentina Gliozzi, Nicola Olivetti. Towards a Rational Closure for Expressive Description Logics:the Case of SHIQ. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2018, 159 (1-2), pp.95-122. ⟨10.3233/FI-2018-1659⟩. ⟨hal-02079796⟩
  • Luigi Santocanale, Friedrich Wehrung. The equational theory of the weak order on finite symmetric groups. Journal of the European Mathematical Society, European Mathematical Society, 2018, 20 (8), pp.1959--2003. ⟨10.4171/JEMS/804⟩. ⟨hal-00986148v2⟩
  • Marianna Girlando, Sara Negri, Nicola Olivetti, Vincent Risch. Conditional Beliefs: from Neighbourhood Semantics to Sequent Calculus. The review of symbolic logic, Cambridge University Press, 2018, pp.1-44. ⟨hal-01702961⟩
  • Nadia Creignou, Reinhard Pichler, Stefan Woltran. Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2018, ⟨10.23638/LMCS-14(4:10)2018⟩. ⟨hal-02077666⟩
  • Meriem Touat, Fatima Benbouzid-Si Tayeb, Belaïd Benhamou. An effective heuristic for the single-machine scheduling problem with flexible maintenance under human resource constraints. Procedia Computer Science, Elsevier, 2018, 126, pp.1395-1404. ⟨10.1016/j.procs.2018.08.091⟩. ⟨hal-02098930⟩
  • Pierre Clairambault, Charles Grellois, Andrzej Murawski. Linearity in higher-order recursion schemes. Proceedings of the ACM on Programming Languages, ACM, 2017, 2, pp.1 - 29. ⟨10.1145/3158127⟩. ⟨hal-01886931⟩

Communication dans un congrès

  • Björn Lellmann, Nicola Olivetti, Elaine Pimentel, Tiziano Dalmonte. Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics. Logical Foundations of Computer Science - International Symposium, LFCS 2020, Jan 2020, Deerfield Beach, United States. ⟨hal-02436312⟩
  • Salem Benferhat, Zied Bouraoui, Odile Papini, Eric Würbel. Assertional Removed Sets Merging of DL-Lite Knowledge Bases. The 13th international conference on Scalable Uncertainty Management, Dec 2019, Compiègne, France. ⟨hal-02392974⟩
  • Tiziano Dalmonte, Sara Negri, Nicola Olivetti, Gian Luca Pozzato. PRONOM: proof-search and countermodel generation for non-normal modal logics. AIIA 2019: 18th International Conference of the Italian Association for Artificial Intelligence, Nov 2019, Rende, Italy. ⟨hal-02439537⟩
  • Meriem Touat, Fatima Benbouzid-Si Tayeb, Belaïd Benhamou, Lamia Sadeg, Salima Aklil, et al.. An Integrated Guided Local Search considering Human Resource Constraints for the Single-machine Scheduling problem with Preventive Maintenance. 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC), Oct 2019, Bari, France. pp.3799-3804, ⟨10.1109/SMC.2019.8914261⟩. ⟨hal-02450017⟩
  • Tarek Khaled, Belaïd Benhamou. An ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean Networks. 35th International Conference on Logic Programming, Sep 2019, Las Cruces, New Mexico, United States. pp.295-301, ⟨10.4204/EPTCS.306.34⟩. ⟨hal-02449921⟩
  • Luigi Santocanale. ON DISCRETE IDEMPOTENT PATHS. Words 2019, Sep 2019, Loughborough, United Kingdom. pp.312--325, ⟨10.1007/978-3-030-28796-2_25⟩. ⟨hal-02153821⟩
  • Marianna Girlando, Sara Negri, Nicola Olivetti. Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics. 26th Workshop on Logic, Language, Information and Computation (WoLLIC 2019), Jul 2019, Utrecht, Netherlands. ⟨hal-02330319⟩
  • Naoki Kobayashi, Ugo Dal Lago, Charles Grellois. On the Termination Problem for Probabilistic Higher-Order Recursive Programs. LICS 2019 - 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, France. pp.1-14, ⟨10.1109/LICS.2019.8785679⟩. ⟨hal-02399361⟩
  • Tarek Khaled, Belaid Benhamou. Élimination des symétries dans une nouvelle méthode de recherche de modèles stables. JFPC 2018, Jun 2019, Amiens, France. ⟨hal-02098933⟩
  • Marianna Girlando, Bjoern Lellmann, Nicola Olivetti. Nested sequents for the logic of conditional belief. JELIA - European Conference on Logics in Artificial Intelligence, May 2019, Rende, Italy. ⟨hal-02077057⟩
  • Eric Würbel, Mohamed Ellefi, Pierre Drap, Laurent Garcia, Fabien Garreau, et al.. Computing Query Answering With Non-Monotonic Rules: A Case Study of Archaeology Qualitative Spatial Reasoning. 5th Global Conference on Artificial Intelligence, Sep 2019, Bolzano, Italy. pp.1-14. ⟨hal-02332016⟩
  • José Luis Vilchis Medina, Pierre Siegel, Vincent Risch, Andrei Doncescu. Intelligent and Adaptive System based on a Non-monotonic Logic for an Autonomous Motor-glider. 15th International Conference on Control, Automation, Robotics and Vision (ICARCV 2018), Nov 2018, Singapore, Singapore. pp.442--447, ⟨10.1109/ICARCV.2018.8581107⟩. ⟨hal-02093392⟩
  • Tarek Khaled, Belaïd Benhamou. Symmetry breaking in a new stable model search method. LPAR-22 Paper Proceedings, Nov 2018, Awassa, Ethiopia. pp.58-40, ⟨10.29007/1l5r⟩. ⟨hal-02098911⟩
  • Tarek Khaled, Belaïd Benhamou, Pierre Siegel. A New Method for Computing Stable Models in Logic Programming. 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2018, Volos, Greece. pp.800-807, ⟨10.1109/ICTAI.2018.00125⟩. ⟨hal-02098927⟩
  • Maria João Gouveia, Luigi Santocanale. MIX STAR-AUTONOMOUS QUANTALES AND THE CONTINUOUS WEAK ORDER. RAMICS 2018, Oct 2018, Groningen, Netherlands. ⟨10.1007/978-3-030-02149-8_12⟩. ⟨hal-01838560⟩
  • Pierre Siegel, Andrei Doncescu, Vincent Risch, Sylvain Sené. Towards a Boolean dynamical system representation in a nonmonotonic modal logic. International Workshop on Non-Monotonic Reasoning (NMR'18), Oct 2018, Tempe, United States. pp.53--62. ⟨hal-02093398⟩
  • Luigi Santocanale, Silvio Ghilardi. Ruitenburg's Theorem via Duality and Bounded Bisimulations. Advances in Modal Logic, Aug 2018, Bern, Switzerland. ⟨hal-01766636⟩
  • Tiziano Dalmonte, Nicola Olivetti, Sara Negri. Non-normal modal logics: bi-neighbourhood semantics and its labelled calculi. Advances in Modal Logic 2018, Aug 2018, Berne, Switzerland. ⟨hal-02076639⟩
  • Laurent Garcia, Claire Lefèvre, Odile Papini, Igor Stephan, Eric Würbel. Possibilistic ASP Base Revision by Certain Input. International Joint Conference on Artificial Intelligence, Jul 2018, Stockholm, Sweden. ⟨hal-01794353⟩
  • Nadia Creignou, Adrian Haret, Odile Papini, Stefan Woltran. Belief Update in the Horn Fragment. Twenty-Seventh International Joint Conference on Artificial Intelligence , Jul 2018, Stockholm, Sweden. pp.1781-1787, ⟨10.24963/ijcai.2018/246⟩. ⟨hal-02077737⟩
  • Luigi Santocanale. The equational theory of the natural join and inner union is decidable. FOSSACS 2018, Apr 2018, Thessaloniki, Greece. pp.494--510, ⟨10.1007/978-3-319-89366-2_27⟩. ⟨hal-01625134⟩
  • Ghassen Hamdi, Mohamed Omri, Odile Papini, Salem Benferhat, Zied Bouraoui. Querying DL-lite Knowledge Bases from Hidden Datasets *. International Symposium on Artificial Intelligence and Mathematics, Jan 2018, Fort Lauderdale, United States. ⟨hal-02084470⟩
  • Marianna Girlando, Sara Negri, Nicola Olivetti. Counterfactual logic: labelled and internal calculi, two sides of the same coin?. Advances in Modal Logics 2018, Aug 2018, Bern, Switzerland. pp.291-310. ⟨hal-02077043⟩
  • Laurent Garcia, Claire Lefevre, Odile Papini, Igor Stephan, Eric Würbel. A Semantic characterization for ASP base revision. Scalable Uncertainty Managemen, Oct 2017, Granada, Spain. pp.334--347. ⟨hal-01770946⟩
  • Luigi Santocanale. Embeddability into relational lattices is undecidable ⋆. RAMICS 2017, May 2017, Lyon, France. ⟨hal-01474822⟩
  • Marianna Girlando, Bjoern Lellmann, Nicola Olivetti, Gian Luca Pozzato, Quentin Vitalis. VINTE: an Implementation of Internal Calculi for Lewis' Logics of Counterfactual Reasoning. TABLEAUX 2017, Sep 2017, Brasilia, Brazil. pp.149-159. ⟨hal-01794382⟩
  • Marianna Girlando, Björn Lellmann, Nicola Olivetti, Gian Pozzato. Hypersequent Calculi for Lewis' Conditional Logics with Uniformity and Reflexivity. TABLEAUX 2017, Sep 2017, Brasilia, Brazil. pp.131-148. ⟨hal-01794387⟩
  • Marianna Girlando, Björn Lellmann, Nicola Olivetti, Gian Pozzato. Standard Sequent Calculi for Lewis' Logics of Counterfactuals. JELIA 2016, Nov 2016, Larnaca, Cyprus. ⟨hal-01794375⟩
  • Marianna Girlando, Sara Negri, Nicola Olivetti, Vincent Risch. The logic of conditional beliefs: neighbourhood semantics and sequent calculus. Advances in Modal Logics 2016, L. Beklemishev, S. Demri and A. Màté, Aug 2016, Budapest, Hungary. pp.322-341. ⟨hal-01794369⟩

Chapitre d'ouvrage


Pré-publication, Document de travail

  • Luigi Santocanale. The Involutive Quantaloid of Completely Distributive Lattices. 2019. ⟨hal-02342655v2⟩
  • Maria João Gouveia, Luigi Santocanale. The continuous weak order. 2019. ⟨hal-01944759v3⟩
  • Gian Meloni, Luigi Santocanale. Relational Semantics for Distributive Linear Logic. 2018. ⟨hal-01851509⟩

Thèse

  • Marianna Girlando. On the Proof Theory of Conditional Logics. Logic in Computer Science [cs.LO]. Aix-Marseille Université; Helsinki University, 2019. English. ⟨tel-02077109⟩