Translating between the representations of a ranked convex geometry O Defrain, L Nourine, S Vilmin
Discrete Mathematics 344 (7), 112399, 2021
7 2021 Functional Dependencies with Predicates: What Makes the g 3-error Easy to Compute? S Vilmin, P Faure–Giovagnoli, JM Petit, VM Scuturici
International Conference on Conceptual Structures, 3-16, 2023
2 2023 Towards declarative comparabilities: application to functional dependencies L Nourine, JM Petit, S Vilmin
arXiv preprint arXiv:1909.12656, 2021
2 2021 Dihypergraph decomposition: application to closure system representations L Nourine, S Vilmin
CEUR Workshop Proceedings, 2020
2 2020 Hierarchical decompositions of dihypergraphs L Nourine, S Vilmin
arXiv preprint arXiv:2006.11831, 2020
2 2020 Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements L Nourine, S Vilmin
Theoretical Computer Science 969, 114030, 2023
1 2023 On the preferred extensions of argumentation frameworks: Bijections with naive sets M Elaroussi, L Nourine, MS Radjef, S Vilmin
Information Processing Letters 181, 106354, 2023
1 2023 Algorithms on closure systems and their representations S Vilmin
Université Clermont Auvergne, 2021
1 2021 Enumerating maximal consistent closed sets in closure systems L Nourine, S Vilmin
Formal Concept Analysis: 16th International Conference, ICFCA 2021 …, 2021
1 2021 Half-space separation in monophonic convexity M Elaroussi, L Nourine, S Vilmin
arXiv preprint arXiv:2404.17564, 2024
2024 Computing the -base and -relation in finite closure systems K Adaricheva, L Nourine, S Vilmin
arXiv preprint arXiv:2404.07037, 2024
2024 On the enumeration of signatures of XOR-CNF's N Creignou, O Defrain, F Olive, S Vilmin
arXiv preprint arXiv:2402.18537, 2024
2024