Functional dependencies, a notion originated in Relational Database Theory, are known to admit interesting characterizations in terms of Formal Concept Analysis. In database terms, two successive, natural extensions of ...

We show that Kolmogorov easy circuit expressions can be learned with membership queries in polynomial time if and only if every NE-predicate is E-solvable. Moreover we show that the previously known algorithm, that uses ...

The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the “essential” or “representative” rules. We revisit the algorithm given ...

We demonstrate how graph decomposition techniques can be employed for the visualization of hierarchical co-occurrence patterns between medical data items. Our research is based on Gaifman graphs (a mathematical concept ...

Degrees in the EHEA (European Higher Education Area) must be designed based on professional skills, so that when the students finish their studies they become competent professionals in the labour market. In this paper we ...

The computational power of neural networks depends on properties of the real numbers used as weights. We focus on networks restricted to compute in polynomial time, operating on boolean inputs. Previous work has demonstrated ...

En este artículo se presenta una visión general a los últimos resultados acontecidos en el área de la estructura de la clase NP-completa y su relación con el problema de si: P=NP o P diferente de NP.

The design of recursive functions is a well-studied subject. Design methods require a specification to start with, however, when an embedding design is attempted at, it is not clear how the specification of the embedding ...

An introduction to the confluence and finite termination properties of rewriting systems is presented and also to the Kunth-Bendix completion algorithm is presented.