A tree series over a semiring with partially ordered carrier set can be considered as a fuzzy set. We investigate conditions under which it can also be understood as a fuzzied rec...
Two ways of constructing maximal sets of mutually orthogonal Latin squares are presented. The first construction uses maximal partial spreads in PG(3, 4)\ PG(3, 2) with r lines, wh...
Patrick Govaerts, Dieter Jungnickel, Leo Storme, J...
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
Abstract. Theoretical foundations and practical realizations of answer set solving techniques are vital research issues. The challenge lies in combining the elevated modeling capac...
A Greedy Defining Set is a set of entries in a Latin square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succee...