Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
The t-concept lattice is introduced as a set of triples associated to graded tabular information interpreted in a non-commutative fuzzy logic. Following the general techniques of ...
Consideration sets provide a standard tool for the exploration of consumer choice. It is appropriate to analyze it as a fuzzy set because not all the brands of a certain category o...
Abstract--In the Relational Reinforcement learning framework, we propose an algorithm that learns an action model allowing to predict the resulting state of each action in any give...
Abstract. We present a categorical denotational semantics for a database mapping, based on views, in the most general framework of a database integration/exchange. Developed databa...