Skip to Main content Skip to Navigation
Conference papers

Embedding median graphs into minimal distributive ∨-semi-lattices

Alain Gély 1 Miguel Couceiro 1 Amedeo Napoli 1 
1 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : It is known that a distributive lattice is a median graph, and that a distributive ∨-semi-lattice can be thought of as a median graph i every triple of elements such that the inmum of each couple of its elements exists, has an inmum. Since a lattice without its bottom element is obviously a ∨-semi-lattice, using the FCA formalism, we investigate the following problem: Given a semi-lattice L obtained from a lattice by deletion of the bottom element, is there a minimum distributive ∨-semi-lattice L d such that L can be order embedded into L d ? We give a negative answer to this question by providing a counter example.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Alain GELY Connect in order to contact the contributor
Submitted on : Wednesday, August 5, 2020 - 4:34:22 PM
Last modification on : Thursday, August 4, 2022 - 5:18:49 PM
Long-term archiving on: : Monday, November 30, 2020 - 3:03:38 PM


Files produced by the author(s)


  • HAL Id : hal-02912341, version 1


Alain Gély, Miguel Couceiro, Amedeo Napoli. Embedding median graphs into minimal distributive ∨-semi-lattices. NFMCP 2019 - 8th International Workshop on New Frontiers in Mining Complex Patterns in conjunction with ECML-PKDD 2019, Sep 2019, Wùzburg, Germany. ⟨hal-02912341⟩



Record views


Files downloads