![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Simon Vilmin
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i9]Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin:
On the enumeration of signatures of XOR-CNF's. CoRR abs/2402.18537 (2024) - [i8]Kira V. Adaricheva, Lhouari Nourine, Simon Vilmin:
Computing the D-base and D-relation in finite closure systems. CoRR abs/2404.07037 (2024) - [i7]Mohammed Elaroussi, Lhouari Nourine, Simon Vilmin:
Half-space separation in monophonic convexity. CoRR abs/2404.17564 (2024) - 2023
- [j3]Mohammed Elaroussi
, Lhouari Nourine, Mohammed Said Radjef
, Simon Vilmin
:
On the preferred extensions of argumentation frameworks: Bijections with naive sets. Inf. Process. Lett. 181: 106354 (2023) - [j2]Lhouari Nourine, Simon Vilmin
:
Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements. Theor. Comput. Sci. 969: 114030 (2023) - [c4]Simon Vilmin, Pierre Faure-Giovagnoli, Jean-Marc Petit, Vasile-Marian Scuturici:
Functional Dependencies with Predicates: What Makes the g3-error Easy to Compute? ICCS 2023: 3-16 - [i6]Simon Vilmin, Pierre Faure-Giovagnoli, Jean-Marc Petit, Vasile-Marian Scuturici:
Functional Dependencies with Predicates: What Makes the g3-error Easy to Compute? CoRR abs/2306.09006 (2023) - 2022
- [i5]Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef, Simon Vilmin:
On the preferred extensions of argumentation frameworks: bijections with naive extensions. CoRR abs/2202.05506 (2022) - [i4]Lhouari Nourine, Simon Vilmin:
The enumeration of meet-irreducible elements based on hierarchical decompositions of implicational bases. CoRR abs/2202.05536 (2022) - 2021
- [b1]Simon Vilmin:
Algorithms on closure systems and their representations. (Algorithmes pour les systèmes de fermeture et leurs représentations). University of Clermont Auvergne, Clermont-Ferrand, France, 2021 - [j1]Oscar Defrain
, Lhouari Nourine, Simon Vilmin
:
Translating between the representations of a ranked convex geometry. Discret. Math. 344(7): 112399 (2021) - [c3]Lhouari Nourine, Simon Vilmin:
Enumerating Maximal Consistent Closed Sets in Closure Systems. ICFCA 2021: 57-73 - [i3]Lhouari Nourine, Simon Vilmin:
Enumerating maximal consistent closed sets in closure systems. CoRR abs/2102.04245 (2021) - 2020
- [c2]Simon Vilmin, Lhouari Nourine:
Dihypergraph Decomposition: Application to Closure System Representations. FCA4AI@ECAI 2020: 31-44 - [c1]Lhouari Nourine, Simon Vilmin:
Hierarchical Decompositions of Dihypergraphs. ICTCS 2020: 158-171 - [i2]Lhouari Nourine, Simon Vilmin:
Hierarchical Decompositions of dihypergraphs. CoRR abs/2006.11831 (2020)
2010 – 2019
- 2019
- [i1]Oscar Defrain, Lhouari Nourine, Simon Vilmin:
Translating between the representations of a ranked convex geometry. CoRR abs/1907.09433 (2019)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-31 02:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint