نتایج جستجو برای: directed complete partially ordered set
تعداد نتایج: 1263669 فیلتر نتایج به سال:
In this paper, we present equivalent characterizations of L-closure systems on lower bounded complete L-ordered sets and complete L-lattices, respectively. These results demonstrate the feasibility of notion of fuzzy closure system developed in our previous work (L.-K. Guo, G.-Q. Zhang, Q.-G. Li: Fuzzy closure systems on L-ordered sets. Math. Log. Quart. 57 (3) (2011), 281-291.). Also we develo...
We prove that the sequential functionals of some fixed types at type level 2, taking finite sequences of unary functions as arguments, do form a directed complete partial ordering. This gives a full characterisation of for which types the partially ordered set of sequential functionals has this property. As a tool, we prove a normal form theorem for the finite sequential functionals of the type...
We prove that the sequential functionals of some fixed types at type level 2, taking finite sequences of unary functions as arguments, form a directed complete partial ordering. This gives a full characterisation of the types for which the partially ordered set of sequential functionals has this property. As a tool, we prove a normal form theorem for the finite sequential functionals of the typ...
Representing and reasoning with an agent’s preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One class of soft constraints formalisms, semiring-based CSPs, allows a partially ordered set of preference degrees, but this set must form a distributive lattice; whilst this is convenient computationally, it considerably restric...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید