Although the history of a scientific discipline should be studied regardless of which year and anniversary it is, with an attention to the idea development, the interdependence of various topics and problems etc., a jubilee can represent a good opportunity to remind some important events that influenced the forthcoming development, or to find some new and unnoticed relations. Coincidentally, in...

Let f(x 1 ; : : : ; x n ) = _ I2F ^ i2I x i and g(x 1 ; : : : ; x n ) = _ I2G ^ i2I x i be a pair of dual monotone irredundant disjunctive normal forms, where F and G are the sets of the prime implicants of f and g, respectively. For a variable x i ; i = 1; : : : ; n, let i = #fI 2 F ji 2 Ig=jF j and i = #fI 2 Gji 2 Ig=jGj be the frequencies with which x i occurs in f and g. It is easily seen t...

We investigate the dynamic stochastic multicriteria decision making (SMCDM) problems, in which the criterion values take the form of log-normally distributed random variables, and the argument information is collected from different periods. We propose two new geometric aggregation operators, such as the log-normal distribution weighted geometric (LNDWG) operator and the dynamic log-normal dist...

Combinatorial and learnability results are proven for projective disjunctive normal forms, a class of DNF expressions introduced by Valiant. Dedicated to Prof. Peter Hammer on the occasion of his 70th birthday.

We consider TU-games with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. In such a situation, the core may be unbounded, and one has to select a bounded part of the core as a solution concept. The restricted core is obtained by imposing equality constraints in the core for sets belonging to so-cal...

This paper investigates ways to reduce redundancy in forbidding sets for language forbidding-enforcing systems. A language forbidding set disallows combinations of subwords in a word, while permitting the presence of some parts of these combinations. Since a forbidding set is a potentially infinite set of finite sets of words, finding normal forms for forbidding sets is interesting from a combi...

We present the definition and a normal form of a class of operators on sets of natural numbers which generalize the enumeration operators.

—In this paper, we examine and compare de Morgan-, Kleene-, and Boolean-disjunctive and conjunctive normal forms in fuzzy settings. This generalizes papers of Turksen on the subject of Boolean-normal forms.

Heap-based data structures play an important role in modern programming concepts. However standard verification algorithms cannot cope with infinite state spaces as induced by these structures. A common approach to solve this problem is to apply abstraction techniques. Hyperedge replacement grammars provide a promising technique for heap abstraction as their production rules can be used to part...

We show that the duality of a pair of monotone disjunctive normal forms of size n can be tested in n oŽlog n.