Classification of poset-block spaces admitting MacWilliams-type identity

In this work we prove that a poset-block space admits a MacWilliams-type identity if and only if the poset is hierarchical and at any level of the poset, all the blocks have the same dimension. When the poset-block admits the MacWilliams-type identity we explicit the relation between the weight enumerators of a code and its dual.Comment: 8 pages, 1 figure. Submitted to IEEE Transactions on Information Theor

Formal Concept Analysis and Resolution in Algebraic Domains

We relate two formerly independent areas: Formal concept analysis and logic of domains. We will establish a correspondene between contextual attribute logic on formal contexts resp. concept lattices and a clausal logic on coherent algebraic cpos. We show how to identify the notion of formal concept in the domain theoretic setting. In particular, we show that a special instance of the resolution rule from the domain logic coincides with the concept closure operator from formal concept analysis. The results shed light on the use of contexts and domains for knowledge representation and reasoning purposes.Comment: 14 pages. We have rewritten the old version according to the suggestions of some referees. The results are the same. The presentation is completely differen

Diversity as Width

It is argued that if the population of options is a finite poset, diversity comparisons may be conveniently based on widths i.e. on the respective maximum numbers of pairwise incomparable options included in the relevant subposets. The width-ranking and the undominated width-ranking are introduced and characterized