Simon Vilmin

According to our database, Simon Vilmin authored at least 18 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Translating between the representations of an acyclic convex geometry of bounded degree.

Oscar Defrain, Arthur Ohana, Simon Vilmin

CoRR, June, 2025

The <i>E</i>-base of finite semidistributive lattices.

Kira V. Adaricheva, Simon Vilmin

CoRR, February, 2025

On the Enumeration of Signatures of XOR-CNF's.

Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

The E-Base of Finite Semidistributive Lattices.

Kira V. Adaricheva, Simon Vilmin

Proceedings of the Conceptual Knowledge Structures - Second International Joint Conference, 2025

2024

Towards declarative comparabilities: Application to functional dependencies.

Lhouari Nourine, Jean-Marc Petit, Simon Vilmin

J. Comput. Syst. Sci., 2024

Computing the <i>D</i>-base and <i>D</i>-relation in finite closure systems.

Kira V. Adaricheva, Lhouari Nourine, Simon Vilmin

CoRR, 2024

Half-Space Separation in Monophonic Convexity.

Mohammed Elaroussi, Lhouari Nourine, Simon Vilmin

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements.

Lhouari Nourine, Simon Vilmin

Theor. Comput. Sci., August, 2023

On the preferred extensions of argumentation frameworks: Bijections with naive sets.

Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef, Simon Vilmin

Inf. Process. Lett., March, 2023

Functional Dependencies with Predicates: What Makes the g₃-error Easy to Compute?

Simon Vilmin, Pierre Faure-Giovagnoli, Jean-Marc Petit, Vasile-Marian Scuturici

CoRR, 2023

Functional Dependencies with Predicates: What Makes the g3-error Easy to Compute?

Simon Vilmin, Pierre Faure-Giovagnoli, Jean-Marc Petit, Vasile-Marian Scuturici

Proceedings of the Graph-Based Representation and Reasoning, 2023

2022

The enumeration of meet-irreducible elements based on hierarchical decompositions of implicational bases.

Lhouari Nourine, Simon Vilmin

CoRR, 2022

On the preferred extensions of argumentation frameworks: bijections with naive extensions.

Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef, Simon Vilmin

CoRR, 2022

2021

Algorithms on closure systems and their representations. (Algorithmes pour les systèmes de fermeture et leurs représentations).

Simon Vilmin

PhD thesis, 2021

Translating between the representations of a ranked convex geometry.

Oscar Defrain, Lhouari Nourine, Simon Vilmin

Discret. Math., 2021

Enumerating Maximal Consistent Closed Sets in Closure Systems.

Lhouari Nourine, Simon Vilmin

Proceedings of the Formal Concept Analysis - 16th International Conference, 2021

2020

Hierarchical Decompositions of Dihypergraphs.

Lhouari Nourine, Simon Vilmin

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

Dihypergraph Decomposition: Application to Closure System Representations.

Simon Vilmin, Lhouari Nourine

Proceedings of the 8th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2020) co-located with 24th European Conference on Artificial Intelligence (ECAI 2020), 2020