Theories, models and bases of attribute implications in multi-adjoint concept lattices with hedges

Abstract Modelling knowledge systems is a fundamental challenge nowadays. Logic rules are essential for this goal in order to, for instance, design decision-support systems in artificial intelligence. However, the determination of these logic rules is a complex problem. In this line, Formal Concept Analysis provides a mechanism to automatically compute rules from a relational data set, which are called attribute implications. The difficulty arises from the potentially large number of valid implications derivable from a given data set, as well as the presence of redundant implications. This paper will focus on the theoretical development of the notions of theory, model and the entailment relations between them, which will allow us to elaborate the notion of basis of attribute implications in the multi-adjoint concept lattice framework enriched with truth-stressing hedges. We will explore one of the most common types of bases, which is constructed by means of the so-called pseudo-intents.

Authors

Institutions

Publication Details

Journal
Computational and Applied Mathematics
Published
2025-09-08
DOI
https://doi.org/10.1007/s40314-025-03391-9
Primary Topic
Rough Sets and Fuzzy Logic
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Theories, models and bases of attribute implications in multi-adjoint concept lattices with hedges

Jesús Medina, M. Eugenia Cornejo, F. Ocaña
Computational and Applied Mathematics
Rough Sets and Fuzzy Logic
article

Theories, models and bases of attribute implications in multi-adjoint concept lattices with hedges

Jesús Medina, M. Eugenia Cornejo, F. Ocaña
article en

Abstract

Abstract Modelling knowledge systems is a fundamental challenge nowadays. Logic rules are essential for this goal in order to, for instance, design decision-support systems in artificial intelligence. However, the determination of these logic rules is a complex problem. In this line, Formal Concept Analysis provides a mechanism to automatically compute rules from a relational data set, which are called attribute implications. The difficulty arises from the potentially large number of valid implications derivable from a given data set, as well as the presence of redundant implications. This paper will focus on the theoretical development of the notions of theory, model and the entailment relations between them, which will allow us to elaborate the notion of basis of attribute implications in the multi-adjoint concept lattice framework enriched with truth-stressing hedges. We will explore one of the most common types of bases, which is constructed by means of the so-called pseudo-intents.

Computational and Applied MathematicsVol. 45(1)
Universidad de Cádiz (ES)
European Commission, Agencia Estatal de Investigación
Openalex Percentile: Top 74%
Rough Sets and Fuzzy Logic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.