نتایج جستجو برای: robust possibilistic programming
تعداد نتایج: 525061 فیلتر نتایج به سال:
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...
Nowadays, the design of a strategic supply chain network under disruption is one of the most important priorities of the governments. One of the strategic purposes of managers is to supply the sustainable agricultural products and food in stable conditions which require the production of soil nutrients. In this regard, some disruptions such as sanctions and natural disasters have a destructive ...
Due to the nature of agricultural and food industry, management production, storage, transportation, waste disposal environmental effects their are great importance. To deal with sustainability issues linked supply chains, we propose in this study a mathematical model design sustainable chain highly perishable product (strawberry). The is multiperiod, multiproduct multiobjective MINLP program t...
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...
Possibilistic decision theory has been proposed twenty years ago and has had several extensions since then. Because of the lack of decision power of possibilistic decision theory, several refinements have then been proposed. Unfortunately, these refinements do not allow to circumvent the difficulty when the decision problem is sequential. In this article, we propose to extend lexicographic refi...
We present an overview on how to perform non-monotonic reasoning based on paraconsistent logics. In particular, we show that one can define a logic programming semantics based on the paraconsistent logic G’3 which is called G’3-stable semantics. This semantics defines a frame for performing non-monotonic reasoning in domains which are pervaded with vagueness and inconsistencies. In fact, we sho...
Argumentation frameworks have proven to be a successful approach to formalizing commonsense reasoning. Recently, some argumentation frameworks have been extended to deal with possibilistic uncertainty, notably Possibilistic Defeasible Logic Programming (P-DeLP). At the same time, modelling argument accrual has gained attention from the argumentation community. Even though some preliminary forma...
Possibilistic decision theory has been proposed twenty years ago and has had several extensions since then. Because of the lack of decision power of possibilistic decision theory, several refinements have then been proposed. Unfortunately, these refinements do not allow to circumvent the difficulty when the decision problem is sequential. In this article, we propose to extend lexicographic refi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید