Yoan Renaud - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2014

Recursive decomposition tree of a Moore co-family and closure algorithmPierre Colomb, Alexis Irlande, Olivier Raynaud, Yoan Renaud. AMAI, 70(1-2):107-122, 2014. [doi]

2013

Recursive decomposition and bounds of the lattice of Moore co-familiesPierre Colomb, Alexis Irlande, Olivier Raynaud, Yoan Renaud. AMAI, 67(2):109-122, 2013. [doi]

2012

Computing Implications with Negation from a Formal ContextRokia Missaoui, Lhouari Nourine, Yoan Renaud. FUIN, 115(4):357-375, 2012. [doi]

Drosophila protein-protein interaction networksYoan Renaud, Alexandre Baillif, Jean-Baptiste Perez, Marie Agier, Engelbert Mephu Nguifo, Vincent Mirouse. nar, 40(Web-Server-Issue):134-139, 2012. [doi]

2011

On Armstrong-compliant logical query languagesMarie Agier, Christine Froidevaux, Jean-Marc Petit, Yoan Renaud, Jef Wijsen. lid 2011: 33-40 [doi]

A Closure Algorithm Using a Recursive Decomposition of the Set of Moore Co-familiesPierre Colomb, Alexis Irlande, Olivier Raynaud, Yoan Renaud. cla 2011: 131-141 [doi]

2010

An Inference System for Exhaustive Generation of Mixed and Purely Negative Implications from Purely Positive OnesRokia Missaoui, Lhouari Nourine, Yoan Renaud. cla 2010: 271-282 [doi]

2008

Generating Positive and Negative Exact Rules Using Formal Concept Analysis: Problems and SolutionsRokia Missaoui, Lhouari Nourine, Yoan Renaud. icfca 2008: 169-181 [doi]

Join on Closure Systems Using Direct Implicational Basis RepresentationYoan Renaud. FMCO 2008: 450-457 [doi]

Quelques aspects algorithmiques sur les systèmes de fermeture. (Some algoritmic aspects on closure systems)Yoan Renaud. PhD thesis, Blaise Pascal University, Clermont-Ferrand, France, 2008. [doi]

2005

Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne BasesAlain Gély, Raoul Medina, Lhouari Nourine, Yoan Renaud. icfca 2005: 235-248 [doi]

Sign in or sign up to see more results.

runs on WebDSL