Simon Vilmin

Orcid: 0000-0001-6240-4981

According to our database1, Simon Vilmin authored at least 12 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the enumeration of signatures of XOR-CNF's.
CoRR, 2024

2023
Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements.
Theor. Comput. Sci., August, 2023

On the preferred extensions of argumentation frameworks: Bijections with naive sets.
Inf. Process. Lett., March, 2023

Functional Dependencies with Predicates: What Makes the g<sub>3</sub>-error Easy to Compute?
CoRR, 2023

Functional Dependencies with Predicates: What Makes the g3-error Easy to Compute?
Proceedings of the Graph-Based Representation and Reasoning, 2023

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

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

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

Translating between the representations of a ranked convex geometry.
Discret. Math., 2021

Enumerating Maximal Consistent Closed Sets in Closure Systems.
Proceedings of the Formal Concept Analysis - 16th International Conference, 2021

2020
Hierarchical Decompositions of Dihypergraphs.
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

Dihypergraph Decomposition: Application to Closure System Representations.
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


  Loading...