نتایج جستجو برای: implication operator
تعداد نتایج: 128694 فیلتر نتایج به سال:
We present some inequalities for operator space numerical radius of $2times 2$ block matrices on the matrix space $mathcal{M}_n(X)$, when $X$ is a numerical radius operator space. These inequalities contain some upper and lower bounds for operator space numerical radius.
Abstract Detecting a community structure on networks is problem of interest in science and many other domains. Communities are special structures which may consist nodes with some common features. The identification overlapping communities can clarify not so apparent features about relationships among the network. A node have membership different degree. Here, we introduce fuzzy based approach ...
This paper deals with the problem of the aggregation of implication functions. After characterizing those binary operations which merge two implication functions into a new implication function, we study some aspects of the aggregated implication functions in terms of the two given ones. In particular, we are interested in aggregation processes such that properties of the implication functions ...
The AGM rationality postulates for belief revision play an important role in the formal-ization of subjunctive queries over knowledge bases. However, the well known triviality results by GG ardenfors in connection with the Ramsey Test make deening a query semantics corresponding to these rationality postulates a diicult task. While existing approaches avoid the triviality results by restricting...
Figure 1: ALDURO ALDURO (Anthopomorphically Legged and Wheeled Duisburg Robot) is a four legged, hydraulically driven walking machine, powered by an internal combustion engine and steered by an on-board operator (Fig. 1). To combine the manoeuvrability of a walking machine with the speed and stability of a wheeled vehicle there is the option of exchanging the two hind feet with two wheels. The ...
This paper characterizes the powerdomain constructions which have been used in the semantics of programming languages in terms of formulas of first order logic under a pre-ordering of provable implication. The goal is to reveal the basic logical significance of the powerdomains by casting them in the right setting. Such a treatment may contribute to a better understanding of their potential use...
in this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. in fact, we obtain somelowen-type and chang-type fuzzy topologies on general fuzzyautomata. to this end, first we define a kuratowski fuzzy interioroperator which induces a lowen-type fuzzy topology on the set ofstates of a max- min general fuzzy automaton. also by provingsome theorems, ...
General Epistemic Logics suffer from the problem of logical omniscience, which is that an agent’s knowledge and beliefs are closed under implication. There have been many attempts to solve the problem of logical omniscience. However, according to our intuition, sometimes an agent’s knowledge and beliefs are indeed closed under implication. Based on the notion of awareness, we introduce two kind...
We develop a denotational, fully abstract semantics for constraint logic programming (clp) with respect to successful and failed observables. The denotational approach turns out very useful for the deenition of new operators on the language as the counterpart of some abstract operations on the denotational domain. In particular, by deening our domain as a cylindric Heyting algebra, we can explo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید