Quantale Modules and their Operators, with Applications

The central topic of this work is the categories of modules over unital quantales. The main categorical properties are established and a special class of operators, called Q-module transforms, is defined. Such operators - that turn out to be precisely the homomorphisms between free objects in those categories - find concrete applications in two different branches of image processing, namely fuzzy image compression and mathematical morphology

Towards a generalisation of formal concept analysis for data mining purposes

In this paper we justify the need for a generalisation of Formal Concept Analysis for the purpose of data mining and begin the synthesis of such theory. For that purpose, we first review semirings and semimodules over semirings as the appropriate objects to use in abstracting the Boolean algebra and the notion of extents and intents, respectively. We later bring to bear powerful theorems developed in the field of linear algebra over idempotent semimodules to try to build a Fundamental Theorem for K-Formal Concept Analysis, where K is a type of idempotent semiring. Finally, we try to put Formal Concept Analysis in new perspective by considering it as a concrete instance of the theory developed

Parameterizing the semantics of fuzzy attribute implications by systems of isotone Galois connections

We study the semantics of fuzzy if-then rules called fuzzy attribute implications parameterized by systems of isotone Galois connections. The rules express dependencies between fuzzy attributes in object-attribute incidence data. The proposed parameterizations are general and include as special cases the parameterizations by linguistic hedges used in earlier approaches. We formalize the general parameterizations, propose bivalent and graded notions of semantic entailment of fuzzy attribute implications, show their characterization in terms of least models and complete axiomatization, and provide characterization of bases of fuzzy attribute implications derived from data

Canonical formulas for k-potent commutative, integral, residuated lattices

Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4. Although the method originally hinged on the relational semantics of those logics, recently it has been completely recast in algebraic terms. In this new perspective canonical formulas are built from a finite subdirectly irreducible algebra by describing completely the behaviour of some operations and only partially the behaviour of some others. In this paper we export the machinery of canonical formulas to substructural logics by introducing canonical formulas for $k$-potent, commutative, integral, residuated lattices ($k$-$\mathsf{CIRL}$). We show that any subvariety of $k$-$\mathsf{CIRL}$ is axiomatised by canonical formulas. The paper ends with some applications and examples.Comment: Some typo corrected and additional comments adde

Injecting Abstract Interpretations into Linear Cost Models

We present a semantics based framework for analysing the quantitative behaviour of programs with regard to resource usage. We start from an operational semantics equipped with costs. The dioid structure of the set of costs allows for defining the quantitative semantics as a linear operator. We then present an abstraction technique inspired from abstract interpretation in order to effectively compute global cost information from the program. Abstraction has to take two distinct notions of order into account: the order on costs and the order on states. We show that our abstraction technique provides a correct approximation of the concrete cost computations

The Singular Value Decomposition over Completed Idempotent Semifields

In this paper, we provide a basic technique for Lattice Computing: an analogue of the Singular Value Decomposition for rectangular matrices over complete idempotent semifields (i-SVD). These algebras are already complete lattices and many of their instances—the complete schedule algebra or completed max-plus semifield, the tropical algebra, and the max-times algebra—are useful in a range of applications, e.g., morphological processing. We further the task of eliciting the relation between i-SVD and the extension of Formal Concept Analysis to complete idempotent semifields (K-FCA) started in a prior work. We find out that for a matrix with entries considered in a complete idempotent semifield, the Galois connection at the heart of K-FCA provides two basis of left- and right-singular vectors to choose from, for reconstructing the matrix. These are join-dense or meet-dense sets of object or attribute concepts of the concept lattice created by the connection, and they are almost surely not pairwise orthogonal. We conclude with an attempt analogue of the fundamental theorem of linear algebra that gathers all results and discuss it in the wider setting of matrix factorization.This research was funded by the Spanish Government-MinECo project TEC2017-84395-P and the Dept. of Research and Innovation of Madrid Regional Authority project EMPATIA-CM (Y2018/TCS-5046)