由格蕴涵代数诱导的伴随半群

给出由格蕴涵代数诱导出的伴随半群及有关概念 ,详细讨论伴随半群中的元素即格蕴涵代数的左映射的性质 ,得到它们的几个等价条件。最后讨论由格蕴涵代数诱导的两个双格半群与伴随半群之间的关系 ,并证明这些半群是幂等的当且仅当它们是由格 H蕴涵代数所诱导     

Bilattices for deductions in multi-valued logic

In this exploratory paper we propose a framework for the deduction apparatus of multi-valued logics based on the idea that a deduction apparatus has to be a tool to manage information on truth values and not directly truth values of the formulas. This is obtained by embedding the algebraic structure V defined by the set of truth values into a bilattice B. The intended interpretation is that the elements of B are pieces of information on the elements of V. The resulting formalisms are particularized in the framework of fuzzy logic programming. Since we see fuzzy control as a chapter of multi-valued logic programming, this suggests a new and powerful approach to fuzzy control based on positive and negative conditions.     

Operator synthesis. I. Synthetic sets, bilattices and tensor algebras

The interplay between the invariant subspace theory and spectral synthesis for locally compact abelian group discovered by Arveson (Ann. of Math. (2) 100 (1974) 433) is extended to include other topics as harmonic analysis for Varopoulos algebras and approximation by projection-valued measures. We propose a “coordinate” approach which nevertheless does not use the technique of pseudo-integral operators, as well as a coordinate free one which allows to extend to non-separable spaces some important results and constructions of Arveson. We solve some problems posed in Arveson (1974).     

Practical aggregation operators for gradual trust and distrust

Trust and distrust are two increasingly important metrics in social networks, reflecting users’ attitudes and relationships towards each other. In this paper, we study the indirect derivation of these metrics’ values for users that do not know each other, but are connected through the network. In particular, we study bilattice-based aggregation approaches and investigate how they can be improved by using ordered weighted averaging techniques, or through the incorporation of knowledge defects. Experiments on a real world data set from CouchSurfing.org demonstrate that the best operators from a theoretical perspective are not always the most suitable ones in practice, and that the sophisticated aggregation methods can outperform the more obvious bilattice-based approaches.