Independent sets of closure operations

04/06/2020
by   Nguyen Hoang Son, et al.
0

In this paper independent sets of closure operations are introduced. We characterize minimal keys and antikeys of closure operations in terms of independent sets. We establish an expression on the connection between minimal keys and antikeys of closure operations based on independent sets. We construct two combinatorial algorithms for finding all minimal keys and all antikeys of a given closure operation based on independent sets. We estimate the time complexity of these algorithms. Finally, we give an NP-complete problem concerning nonkeys of closure operations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2017

Efficient enumeration of solutions produced by closure operations

In this paper we address the problem of generating all elements obtained...
research
02/05/2021

Enumerating maximal consistent closed sets in closure systems

Given an implicational base, a well-known representation for a closure s...
research
10/02/2012

Relationship between the second type of covering-based rough set and matroid via closure operator

Recently, in order to broad the application and theoretical areas of rou...
research
02/17/2020

Unique key Horn functions

Given a relational database, a key is a set of attributes such that a va...
research
01/28/2021

On computable aspects of algebraic and definable closure

We investigate the computability of algebraic closure and definable clos...
research
01/13/2020

Maximal Closed Set and Half-Space Separations in Finite Closure Systems

We investigate some algorithmic properties of closed set and half-space ...
research
07/18/2021

Cospanning characterizations of antimatroids and convex geometries

Given a finite set E and an operator σ:2^E⟶2^E, two sets X,Y⊆ E are cosp...

Please sign up or login with your details

Forgot password? Click here to reset