research
∙
05/12/2023
Complexity of conjunctive regular path query homomorphisms
A graph database is a digraph whose arcs are labeled with symbols from a...
share
research
∙
02/11/2022
The enumeration of meet-irreducible elements based on hierarchical decompositions of implicational bases
We study the well-known problem of translating between two representatio...
research
∙
02/11/2022
On the preferred extensions of argumentation frameworks: bijections with naive extensions
This paper deals with the problem of finding the preferred extensions of...
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
∙
06/21/2020
Hierarchical Decompositions of dihypergraphs
In this paper we are interested in decomposing a dihypergraph ℋ = (V, ℰ)...
research
∙
04/15/2020
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
Enumerating minimal transversals in a hypergraph is a notoriously hard p...
research
∙
02/18/2020
Representations for the largest Extension of a closure system
We consider extension of a closure system on a finite set S as a closure...
research
∙
09/27/2019
Possible/Certain Functional Dependencies
Incomplete information allow to deal with data with errors, uncertainty ...
research
∙
07/22/2019
Translating between the representations of a ranked convex geometry
It is well known that every closure system can be represented by an impl...
research
∙
02/19/2019
On the dualization in distributive lattices and related problems
In this paper, we study the dualization in distributive lattices, a gene...
research
∙
01/22/2019
Dualization in lattices given by implicational bases
It was recently proved that the dualization in lattices given by implica...
research
∙
05/07/2018