Tree automata modulo associativity and commutativity axioms, called AC tree automata, accept trees by iterating the transition modulo equational reasoning. The class of languages accepted by monotone AC tree automata is known to include the solution set of the inequality x × y > z, which implies that the class properly includes the AC closure of regular tree languages. In the paper, we characte...

Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of computing them is adding the weights of the satisfied variables and checking if the sum is greater than the threshold; this algorithm is inherently non-monotone since addition is a non-monotone function. In this work w...

Interval-valued intuitionistic fuzzy sets (IVIFSs), a generalization of fuzzy sets, is characterized by an interval-valued membership function, an interval-valued non-membership function.The objective of this paper is to deal with criteria aggregation problems using IVIFSs where there exists a prioritization relationship over the criteria.Based on the ${L}$ukasiewicz triangular norm, we first p...