Today most research related to manufacturing strategy development concentrates on descriptive processes and conceptual models, and therefore lacks the capability of assessing the supportive degree of manufacturing strategy to competitive priorities, and is also difficult to assess the congruence among various decisions of the manufacturing strategy. This paper proposes an approach for manufactu...

For theoretical fuzzy control it is a well known strategy to transform a system of control rules into a system of relation equations. Because these systems of relation equations are not always solvable, solvability criteria and approximate solutions have been discussed. We reconsider some of the results in this field and extend them using more recent results on t-norm based fuzzy logics and on ...

Let f be an integer greater than one. We study three progressively finer equivalence relations on closed 3-manifolds generated by Dehn surgery with denominator f : weak f -congruence, f -congruence, and strong f -congruence. If f is odd, weak f -congruence preserves the ring structure on cohomology with Zf -coefficients. We show that strong f -congruence coincides with a relation previously stu...

An important concept in the theory of residuated lattices and other algebraic structures used for formal fuzzy logic, is that of a filter. Filters can be used, amongst others, to define congruence relations. Specific kinds of filters include Boolean filters and prime filters. In this paper, we define several different filters of residuated lattices and triangle algebras and examine their mutual...

In this paper I investigate the System of fuzzy relation equations with inf → composition. I compare this system with the system of fuzzy relation equations with sup − ∗-composition. The purpose of this contribution is to show that there are many things which are common for both systems with sup−∗ and inf →-composition operations. K e y w o r d s: System of fuzzy relation equations; sup − ∗-com...

A notion of refinement for concurrent object-oriented programs was originally presented in [3]. ln th.is article we prove that the refinement relation associated to this notion is a congruence with respect to various standard programming language constructors, including parallel and sequential composition, conditionals, and nondeterministic internal choice. We also establish a weaker compositio...

First, Similarity Of Fuzzy Ontology Generation For Semantic Web, Fuzzy Formal Concept Analysis incorporates fuzzy logic into Formal Concept Analysis (FCA) to form a fuzzy concept lattice. The fuzzy ontology is an extension of the domain ontology for solving the uncertainty problems. Fuzzy Conceptual Clustering then constructs the concept hierarchy from the fuzzy concept lattice. Finally, Fuzzy ...

A notion of reenement for concurrent object-oriented programs was originally presented in 3]. In this article we prove that the reenement relation associated to this notion is a congruence with respect to various standard programming language constructors, including parallel and sequential composition, conditionals, and non-deterministic internal choice. We also establish a weaker compositional...

Q is any quasivariety. A congruence relation 0 on a member A of Q is a Q-congruence if A/0 G Q. The set CouqA. of all Qcongruences is closed under arbitrary intersection and hence forms a complete lattice Cong A. Q. is relatively congruence-distributive if ConjA is distributive for every A e Q.. Relatively congruence-distributive quasivarieties occur naturally in the theory of abstract data typ...