Solving Generalized Equations with Bounded Variables and Multiple Residuated Operators

This paper studies the resolution of sup-inequalities and sup-equations with bounded variables such that the sup-composition is defined by using different residuated operators of a given distributive biresiduated multi-adjoint lattice. Specifically, this study has analytically determined the whole set of solutions of such sup-inequalities and sup-equations. Since the solvability of these equations depends on the character of the independent term, the resolution problem has been split into three parts distinguishing among the bottom element, join-irreducible elements and join-decomposable elements

Heterogeneous environment on examples

We propose a running example for heterogeneous approach based on new type of fuzzification that diversifies fuzziness of every object, fuzziness of every attribute and fuzziness of every table value in a formal context. Moreover we suggest another working examples on heterogeneous environment and provide additional utilization and illustration of this new model that allows to use Formal Concept Analysis also for heterogenenous data. An interpretation of heterogeneous formal concepts and the resulting concept lattice is included

Heterogeneous environment on examples

We propose a running example for heterogeneous approach based on new type of fuzzification that diversifies fuzziness of every object, fuzziness of every attribute and fuzziness of every table value in a formal context. Moreover we suggest another working examples on heterogeneous environment and provide additional utilization and illustration of this new model that allows to use Formal Concept Analysis also for heterogenenous data. An interpretation of heterogeneous formal concepts and the resulting concept lattice is included

Fuzzy logic programs as hypergraphs. Termination results

Graph theory has been a useful tool for logic programming in many aspects. In this paper, we propose an equivalent representation of multi-adjoint logic programs using hypergraphs, which are a generalization of classical graphs that allows the use of hypergraph theory in logic programming. Specifically, this representation has been considered in this paper to increase the level and flexibility of different termination results of the computation of the least model of fuzzy logic programs via the immediate consequence operator. Consequently, the least model of more general and versatile fuzzy logic programs can be obtained after finitely many iterations, although infinite programs or programs with loops and general aggregators will be consideredAgencia Estatal de Investigación PID2019-108991GB-I00Junta de Andalucía FEDER-UCA18-108612European Union COST Action CA1712