Since transitivity is quite often violated even by decisión makers that accept transitivity in their preferences as a condition for consistency, a standard approach to deal with intransitive preference elicitations is the search for a cióse enough transitive preference relation, assuming that such a violation is mainly due to decisión maker estimation errors. In some way, the more number of eli...

Rough set theory was proposed by Pawlak [1] as a mathematical tool to handle imprecision and uncertainty in data analysis. It has been successfully applied tomachine learning, intelligent systems, inductive reasoning, pattern recognition, mereology, image processing, signal analysis, knowledge discovery, decision analysis, expert systems, and many other fields [2–5]. The basic structure of roug...

‎in this article we discuss examples of fractal $omega$-operads‎. ‎thus we show that there is an $omega$-operadic approach to explain existence of‎ ‎the globular set of globular setsfootnote{globular sets are also called $omega$-graphs by the french school.}‎, ‎the reflexive globular set of reflexive globular sets‎, ‎the $omega$-magma of $omega$-magmas‎, ‎and also the reflexive $omega$-magma of...

We study the (non-uniform) quantified constraint satisfaction problem QCSP(H) as H ranges over partially reflexive forests. We obtain a complexity-theoretic dichotomy: QCSP(H) is either in NL or is NP-hard. The separating condition is related firstly to connectivity, and thereafter to accessibility from all vertices of H to connected reflexive subgraphs. In the case of partially reflexive paths...

The class of regular languages can be generated from the regular expressions. These regular expressions, however, do not themselves form a regular language, as can be seen using the pumping lemma. On the other hand, the class of enumerable languages can be enumerated by a universal language that is one of its elements. We say that the enumerable languages are reflexive. In this paper we investi...

1. Introduction This study provides a computer-simulated optimal selection of antecedent of reflexive pronouns based on the Visual C++ computer programming language. The algorithm that I use for this implementation is based on the optimal theoretic approach to the proper interpretation of reflexive pronoun roughly adopted in Moon (1999). I show that the complex behavior of reflexive pronouns ca...

Let R be a commutative noetherian local ring that is not Gorenstein. It is known that the category of totally reflexive modules over R is representation infinite, provided that it contains a non-free module. The main goal of this paper is to understand how complex the category of totally reflexive modules can be in this situation. Local rings (R, m) with m3 = 0 are commonly regarded as the stru...

(including the generalized coupled Sylvester matrix equations as special cases) have numerous applications in control and system theory. In this paper, an iterative algorithm is constructed to solve the general coupled matrix equations and their optimal approximation problem over generalized reflexive matrix solution (X1,X2, . . . ,Xq). When the general coupled matrix equations are consistent o...