Description lattices of generalised convex hulls

DOI10.1016/j.ijar.2024.109269MaRDI QIDQ6638833

Christophe Demko, Jean-François Viaud, Damien Mondou, Karell Bertet, C. Faucher

Publication date: 14 November 2024

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

closure operatorsconcept latticespattern structuresgeneralised convex hull

Mathematics Subject Classification ID

Knowledge representation (68T30) Structure theory of lattices (06B05) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extreme point axioms for closure spaces
• Meet-distributive lattices and the anti-exchange closure
• A depth-first search algorithm for computing pseudo-closed sets
• Join-semidistributive lattices and convex geometries.
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Ordered direct implicational basis of a finite closure system
• \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data
• Optimum basis of finite convex geometry
• On closed elements in closure algebras
• Axioms for convexity
• Meet-distributive lattices have the intersection property
• The duality between the anti-exchange closure operators and the path independent choice operators on a finite set

This page was built for publication: Description lattices of generalised convex hulls