Generalized domination in closure systems

DOI10.1016/j.dam.2005.04.009zbMath1093.68033OpenAlexW2047430636MaRDI QIDQ2489652

Eric Sanjuan, Anne Berry, Alain Sigayret

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.04.009

zbMATH Keywords

Functional dependenciesGraph TheoryPrime implicatesFinite closure systemsFinite latticesPropositional Horn functions

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (2)

The multiple facets of the canonical direct unit implicational basis ⋮ Horn representation of a concept lattice

Uses Software

• Ltur

Cites Work

• The poset of closures as a model of changing databases
• LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
• Horn functions and their DNFs
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Representing a concept lattice by a graph
• Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms
• Two Basic Algorithms in Concept Analysis
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Algorithmic Aspects of Vertex Elimination on Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized domination in closure systems