Representations for the largest extension of a closure system

DOI10.1007/s11083-021-09591-2arXiv2002.07680OpenAlexW3005965889MaRDI QIDQ6105029

Khaled Maafa, Lhouari Nourine, Karima Ennaoui

Publication date: 26 June 2023

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.07680

zbMATH Keywords

latticeclosure systemimplicational baselargest extensionincremental polynomial enumeration algorithm

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closure operators and lattice extensions
• Join-semidistributive lattices and convex geometries.
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• A representation of antimatroids by Horn rules and its application to educational systems
• Largest extension of a finite convex geometry
• Lattice Theory: Special Topics and Applications
• Lattice Theory: Foundation
• Two Basic Algorithms in Concept Analysis
• Base Points, Non-unit Implications, and Convex Geometries
• Formal Concept Analysis

This page was built for publication: Representations for the largest extension of a closure system