[HTML][HTML] The joy of implications, aka pure horn formulas: mainly a survey
M Wild - Theoretical Computer Science, 2017 - Elsevier
The joy of implications, aka pure Horn formulas: Mainly a survey - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
Combining algorithms to find signatures that predict risk in early-stage stomach cancer
JB Nation, J Cabot-Miller, O Segal, R Lucito… - Journal of …, 2021 - liebertpub.com
This study applied two mathematical algorithms, lattice up-stream targeting (LUST) and D-
basis, to the identification of prognostic signatures from cancer gene expression data. The …
basis, to the identification of prognostic signatures from cancer gene expression data. The …
Enumerating minimal solution sets for metric graph problems
B Bergougnoux, O Defrain… - … -Theoretic Concepts in …, 2023 - books.google.com
Problems from metric graph theory like METRIC DIMENSION, GEODETIC SET, and
STRONG METRIC DIMENSION have recently had a strong impact in parameterized …
STRONG METRIC DIMENSION have recently had a strong impact in parameterized …
Importance of overnight parameters to predict Sea Breeze on Long Island
K Adaricheva, JE Bernhardt, W Liu… - arXiv preprint arXiv …, 2023 - arxiv.org
The sea breeze is a phenomenon frequently impacting Long Island, New York, especially
during the spring and early summer, when land surface temperatures can exceed ocean …
during the spring and early summer, when land surface temperatures can exceed ocean …
[HTML][HTML] Algorithms for k-meet-semidistributive lattices
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 …
computation of the set-colored poset associated to an implicational base. The parameter k is …
Translating between the representations of a ranked convex geometry
It is well known that every closure system can be represented by an implicational base, or by
the set of its meet-irreducible elements. In Horn logic, these are respectively known as the …
the set of its meet-irreducible elements. In Horn logic, these are respectively known as the …
From an implicational system to its corresponding D-basis
E Rodríguez-Lorenzo, K Adaricheva, P Cordero-Ortega… - 2015 - riuma.uma.es
Closure system is a fundamental concept appearing in several areas such as databases,
formal concept analysis, artificial intelligence, etc. It is well-known that there exists a …
formal concept analysis, artificial intelligence, etc. It is well-known that there exists a …
[HTML][HTML] Using congruence relations to extract knowledge from concept lattices
It is well-known inside the Formal Concept Analysis (FCA) community that a concept lattice
could have an exponential size with respect to the input data. Hence, the size of concept …
could have an exponential size with respect to the input data. Hence, the size of concept …
On the usability of probably approximately correct implication bases
We revisit the notion of probably approximately correct implication bases from the literature
and present a first formulation in the language of formal concept analysis, with the goal to …
and present a first formulation in the language of formal concept analysis, with the goal to …
Formation of the D-basis from implicational systems using Simplification logic
E Rodríguez-Lorenzo, K Adaricheva… - … Journal of General …, 2017 - Taylor & Francis
Sets of implications defining closure systems are used as a standard way to represent
knowledge, and the search of implicational systems satisfying some criteria constitutes one …
knowledge, and the search of implicational systems satisfying some criteria constitutes one …