Many quality measures for rule discovery are binary measures, they are designed to rate binary rules (rules which separate the database examples into two categories eg. “it is a bird” vs. “it is not a bird”) and they cannot rate N -ary rules (rules which separate the database examples into N categories eg. “it is a bird” or “it is an insect” or “it is a fish”). Many quality measures for classif...

One of key issues for α-n(t) ary resolution automated reasoning based on lattice-valued logic with truthvalue in a lattice implication algebra is to investigate the α-n(t) ary resolution of some generalized literals. In this article, the determination of α-resolution of any 3-ary generalized literals which include the implication operators not more than 2 in LP(X). It not only lay the foundatio...

In this paper, given a q-ary LCZ sequence set with parameters (N,M,L, ǫ) and even q, we construct another q-ary LCZ sequence set with parameters (2N, 2M,L, 2ǫ) when q is even. Especially for odd L such that L|N , if a q-ary optimal LCZ sequence set with parameters (N,M,L, 1) is used, the new set with parameters (2N, 2M,L, 2) can be optimal in terms of the set size.

Node selection in trees is a fundamental operation to XML databases, programming languages, and information extraction. We propose a new class of querying languages to define n-ary node selection queries as compositions of monadic queries. The choice of the underlying monadic querying language is parametric. We show that compositions of monadic MSO-definable queries capture n-ary MSO-definable ...

A k-ary de Bruijn sequence of order n is a cyclic sequence of length k in which each k-ary string of length n appears exactly once as a substring. A shift rule for a de Bruijn sequence of order n is a function that maps each length n substring to the next length n substring in the sequence. We present the first known shift rule for k-ary de Bruijn sequences that runs in O(1)-amortized time per ...

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...