Francisco Pérez-Gámez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Francisco Pérez-Gámez has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Angel Mora
Universidad de Málaga
6 shared publications - Pablo Cordero
Department of Applied Mathematics, University of Málaga, Málaga, Spaina
5 shared publications - Manuel Enciso
Universidad de Málaga
4 shared publications - Domingo López-Rodríguez
University of Malaga
3 shared publications Carlos Bejines
1 shared publication- Manuel Ojeda-Aciego
Departamento de Matemática Aplicada, Universidad de Málaga, 29071 Málaga, Spain
1 shared publication
Latest Publications
- 17 August 2026
- Published by Taylor & Francis in International Journal of General Systems
- p. 1-19
Strong attribute implications in data with unknown information
- 17 August 2026
- Published by Taylor & Francis in International Journal of General Systems
- p. 1-19
Strong attribute implications in data with unknown information
- Open Access
- 20 January 2025
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 179
An exploration of weak Heyting algebras: Characterization and properties
- 20 January 2025
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 179
Open AccessAn exploration of weak Heyting algebras: Characterization and properties
- Open Access
- 3 June 2024
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 490
Attribute implications with unknown information based on weak Heyting algebras
- 3 June 2024
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 490
Open AccessAttribute implications with unknown information based on weak Heyting algebras
- Open Access
- 9 August 2022
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 15 (1) , 1-16
Minimal Generators from Positive and Negative Attributes: Analysing the Knowledge Space of a Mathematics Course
Formal concept analysis is a data analysis framework based on lattice theory. In this paper, we analyse the use, inside this framework, of positive and negative (mixed) attributes of a dataset, which has proved to represent more information on the use of just positive attributes. From a theoretical point of view, in this paper we show the structure and the relationships between minimal generators of the simple and mixed concept lattices. From a practical point of view, the obtained theoretical results allow us to ensure a greater granularity in the retrieved information. Furthermore, due to the relationship between FCA and Knowledge Space theory, on a practical level, we analyse the marks of a Mathematics course to establish the knowledge structure of the course and determine the key items providing new relevant information that is not evident without the use of the proposed tools.
- 9 August 2022
- Published by Springer Nature in International Journal of Computational Intelligence Systems
- Vol. 15 (1) , 1-16
Open AccessMinimal Generators from Positive and Negative Attributes: Analysing the Knowledge Space of a Mathematics Course
Formal concept analysis is a data analysis framework based on lattice theory. In this paper, we analyse the use, inside this framework, of positive and negative (mixed) attributes of a dataset, which has proved to represent more information on the use of just positive attributes. From a theoretical point of view, in this paper we show the structure and the relationships between minimal generators of the simple and mixed concept lattices. From a practical point of view, the obtained theoretical results allow us to ensure a greater granularity in the retrieved information. Furthermore, due to the relationship between FCA and Knowledge Space theory, on a practical level, we analyse the marks of a Mathematics course to establish the knowledge structure of the course and determine the key items providing new relevant information that is not evident without the use of the proposed tools.
- Open Access
- 16 February 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (4) , 607
Simplifying Implications with Positive and Negative Attributes: A Logic-Based Approach
Concepts and implications are two facets of the knowledge contained within a binary relation between objects and attributes. Simplification logic (SL) has proved to be valuable for the study of attribute implications in a concept lattice, a topic of interest in the more general framework of formal concept analysis (FCA). Specifically, SL has become the kernel of automated methods to remove redundancy or obtain different types of bases of implications. Although originally FCA used only the positive information contained in the dataset, negative information (explicitly stating that an attribute does not hold) has been proposed by several authors, but without an adequate set of equivalence-preserving rules for simplification. In this work, we propose a mixed simplification logic and a method to automatically remove redundancy in implications, which will serve as a foundational standpoint for the automated reasoning methods for this extended framework.
- 16 February 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (4) , 607
Open AccessSimplifying Implications with Positive and Negative Attributes: A Logic-Based Approach
Concepts and implications are two facets of the knowledge contained within a binary relation between objects and attributes. Simplification logic (SL) has proved to be valuable for the study of attribute implications in a concept lattice, a topic of interest in the more general framework of formal concept analysis (FCA). Specifically, SL has become the kernel of automated methods to remove redundancy or obtain different types of bases of implications. Although originally FCA used only the positive information contained in the dataset, negative information (explicitly stating that an attribute does not hold) has been proposed by several authors, but without an adequate set of equivalence-preserving rules for simplification. In this work, we propose a mixed simplification logic and a method to automatically remove redundancy in implications, which will serve as a foundational standpoint for the automated reasoning methods for this extended framework.
- 22 June 2021
- Published by Springer Nature
- p. 74-90
A New Kind of Implication to Reason with Unknown Information
- 22 June 2021
- Published by Springer Nature
- p. 74-90
A New Kind of Implication to Reason with Unknown Information