نتایج جستجو برای: possibilistic programming
تعداد نتایج: 330913 فیلتر نتایج به سال:
Possibilistic answer set programming (PASP) unites answer set programming (ASP) and possibilistic logic (PL) by associating certainty values with rules. The resulting framework allows to combine both non-monotonic reasoning and reasoning under uncertainty in a single framework. While PASP has been well-studied for possibilistic definite and possibilistic normal programs, we argue that the curre...
Portfolio selection is an important issue for researchers and practitioners. Compared with the conventional probabilistic mean-variance method, fuzzy number can better describe an uncertain environment with vagueness and ambiguity. In this paper, the portfolio selection model with transaction costs and lending is proposed by means of possibilistic mean and possibilistic variance under the assum...
This paper continues the authors’ research in stability analysis in possibilistic programming in that it extends the results in [7] to possibilistic linear programs with multiple objective functions. Namely, we show that multiobjective possibilistic linear programs with continuous fuzzy number coefficients are well-posed, i.e. small changes in the membership function of the coefficients may cau...
Recent research has identified the notion of indirect consistency as a rationality postulate that every rule-based argumentation frameworks should satisfy. Possibilistic Defeasible Logic Programming (PDeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at objectlanguage level, in which indirect consistency does not hold. In ...
12 Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from 13 argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-lan14 guage level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot 15 be expressed in the object la...
Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not well-motivated, and do not always yield intuitive results. To develop a more suitable semantics, we first introduce a characterization of answer sets of classical ASP p...
Identification of Possibilistic Linear Systems by Quadratic Membership Functions of Fuzzy Parameters
We have already formalized several models of the possibilistic linear regression analysis, where it is assumed that possibilistic parameters are non-interactive, i.e., the joint possibilistic distribution of parameters is defined by minimum operators. In this paper, we will deal with the interactive case in which quadratic membership functions defined by A. Celmins are considered. With the same...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید