نتایج جستجو برای: powerset operator
تعداد نتایج: 94892 فیلتر نتایج به سال:
This paper discusses a case study of the board game of Scotland Yard from a computational perspective. Interestingly, Scotland Yard is a genuine “playgame” with imperfect information. For reasons not completely clear to me, games with imperfect information have escaped the interest of researchers in Algorithmic combinatorial gametheory. I show by means of a powerset argument, that Scotland Yard...
Complete lattices are considered with suitable families of lattice morphisms that provide a structure (L,Φ), useful to characterize ground categories of L-sets by means of powerset operators associated to morphisms of these categories. The construction of ground categories and powerset operators presented here extends and unifies most approaches previously considered, allowing the use of noncri...
We give a category-theoretic formulation of Engeler-style models for the untyped λ-calculus. In order to do so, we exhibit an equivalence between distributive laws and extensions of one monad to the Kleisli category of another and explore the example of an arbitrary commutative monad together with the monad for commutative monoids. On Set as base category, the latter is the finite multiset mona...
The recent theory of plausible and paradoxical reasoning (DSmT) developed by the authors appears to be a nice promising theoretical tools to solve many information fusion problems where the Shafer’s model cannot be used due to the intrinsic paradoxical nature of the elements of the frame of discernment and where a strong internal conflict between sources arises. The main idea of DSmT is to work...
operations for its analysis. We show that the analysis induced by E is very imprecise. Hence, in Section 5 we refine the domain E into the more precise domain ER for escape analysis. In Section 6, we discuss our prototype implementation and experimental results. Section 7 concludes the paper by highlighting the differences between previous proposals and our own approach. Section 8 contains the ...
We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T to admit a functorial relation lifting: one is the existence of a distributive law of T over the “powerset monad” on categories, one is the preservation by T of “exactness” of certain squares. Both characterisations ...
In this work, we describe an adjunction between the comma category of Set-based monads under the V -powerset monad and the category of associative lax extensions of Set-based monads to the category of V -relations. In the process, we give a general construction of the Kleisli extension of a monad to the category of V-relations.
A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In these situations (except when central involutions intervene) all minimal permutation representations have the same set of orbit sizes. Using the same ideas w...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید