Just as ordinary hypergraphs are a generalization of graphs, directed hypergraphs (DH) are
a natural generalization of digraphs. A DH consists of a set of vertices V and a set of …

Abstract Classical Formal Concept Analysis (FCA) extracts, represents and manages
knowledge from positive information, ie, its fundamental data model is a binary relation …

In rough set theory (RST), the notion of decision table plays a fundamental role. In this
paper, we develop a purely mathematical investigation of this notion to show that several …

Problems from metric graph theory like METRIC DIMENSION, GEODETIC SET, and
STRONG METRIC DIMENSION have recently had a strong impact in parameterized …

High-order structures have been recognised as suitable models for systems going beyond
the binary relationships for which graph models are appropriate. Despite their importance …

We study algorithms to compute the Shapley value for a cooperative game on a lattice L
Σ=(F Σ,⊆) where F Σ is the family of closed sets given by an implicational system Σ on a set …

Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite
convex geometry can be embedded into a convex geometry of finitely many points in an n …

It was recently proved that the dualization in lattices given by implicational bases is
impossible in output-polynomial time unless P= NP. In this paper, we show that this result …

In this paper we consider k-meet-semidistributive lattices and we are interested in the
computation of the set-colored poset associated to an implicational base. The parameter k is …

We generalize the notion of quasi-closed element to fuzzy posets in two stages: First, in the
crisp style in which each element in a given universe either is quasi-closed or not. Second …