In this paper, we present a Java constraint programming prototype called AbsCon which has been conceived to deal with CSP abstraction. AbsCon considers n-ary constraints and implements diierent value and variable ordering heuristics as well as diierent propagation methods. As AbsCon exploits object technology, it is easy to extend its functionalities.

Fuzzy n-ary hypergroups were introduced as suitable generalizations of fuzzy polygroups and a special case of fuzzy n-ary hyper groups. The aim of this paper is to introduce the notion of fuzzy n-ary factor polygroups of a polygroup. Based on the fuzzy n-ary factor group, we also study the product structures of the generating fuzzy factor n-ary groups. At the end of the paper, we prove the fund...

We characterize the set of all n-ary quasigroups of order 4: every n-ary quasigroup of order 4 is permutably reducible or semilinear. Permutable reducibility means that an n-ary quasigroup can be represented as a composition of k-ary and (n− k +1)-ary quasigroups for some k from 2 to n−1, where the order of arguments in the representation can differ from the original order. The set of semilinea...

Experiential avoidance (EA) involves the unwillingness to remain in contact with aversive experiences such as painful feelings, thoughts, and emotions. EA is often associated with the development and maintenance of emotional problems. Since loneliness is characterized by negative emotions such as sadness and pessimism, which is often linked to emotional problems, this study aims to test the med...

The notion of an n-ary group is a natural generalization of the notion of a group and has many applications in different branches. In this paper, the notion of (normal) fuzzy n-ary subgroup of an n-ary group is introduced and some related properties are investigated. Characterizations of fuzzy n-ary subgroups are given.

The aim of this paper is to present a numerical method for singularly perturbed convection-diffusion problems with a delay. The method is a combination of the asymptotic expansion technique and the reproducing kernel method (RKM). First an asymptotic expansion for the solution of the given singularly perturbed delayed boundary value problem is constructed. Then the reduced regular delayed diffe...

In Bevan et al. (2016), the study of patterns in forests of binary shrubs was introduced. A k-ary heap H is a k-ary tree labeled with {1, . . . , n} such that every child has a larger label than its parent. Given a k-ary heap H , we associate a permutation σH with H by recording the vertex labels as they are encountered in the breadth-first search of the tree. For example, in Figure 1, we pictu...

In this paper we investigate the structure and representation of n-ary algebras arising from DNA recombination, where n is a number of DNA segments participating in recombination. Our methods involve a generalization of the Jordan formalization of observables in quantum mechanics in n-ary splicing algebras. We show that the splicing algebras are an n-ary envelope for algebras of DNA recombinati...

Given an algebra A, p.(A) denotes the number of distinct n-ary term operations t :A" ~ A of A which depend on all n variables. We solve some problems of Berman, Gr~itzer and Kisielewicz concerning the sequence (po(A),pl(A) ..... p.(A) .... ) in case [A I is finite. Our methods yield new results about totally symmetric functions on a finite set.

We present e cient parallel algorithms for solving two graph layout problems: Find a F ary Embedding on a grid and construct a rectangular dual for planar graphs. The algorithm for the rst problem takes O(logn log n) time with O(n) processors on a PRAM. The algorithm for the second problem takes O(log 2 n) time with O(n) processors.