نتایج جستجو برای: possibilistic programming
تعداد نتایج: 330913 فیلتر نتایج به سال:
Answer set programming (ASP) is a form of logic programming in which negation-as-failure is defined in a purely declarative way, based on the notion of a stable model. This short paper briefly explains how a recent generalization of possibilistic logic (GPL) can be used to characterize the semantics of answer set programming. This characterization has several advantages over existing characteri...
Defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. Defeasible Logic Programming (DeLP) is a defeasible argumentation formalism based on an extension of logic programming. Although DeLP has been successfully integrated in a number of different real-world applications, D...
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Defeasible argumentation in general and P-DeLP in particular provide a way of modelling non-monotonic inference. From a logical v...
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Defeasible argumentation in general and P-DeLP in particular provide a way of modelling non-monotonic inference. From a logical v...
In this study, an integration of the analytic hierarchy process (AHP) and a multi-objective possibilistic linear programming (MOPLP) technique is developed to account for all tangible, intangible, quantitative, and qualitative factors which are used to evaluate and select suppliers and to define the optimum order quantities assigned to each. A multi-objective linear programming technique is fir...
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Defeasible argumentation in general and P-DeLP in particular provide a way of modelling non-monotonic inference. When modelling i...
The importance of social responsibility of corporate and business units is increasingly emphasized by researchers and practitioners in recent years. Since supply chains play important roles in today’s business environment, the issue of social responsibility should be considered carefully when designing and planning of supply chains to move towards sustainability. This paper addresses the proble...
Health service management plays a crucial role in human life. Blood related operations are considered as one of the important components of the health services. This paper presents a bi-objective mixed integer linear programming model for dynamic location-allocation of blood facilities that integrates strategic and tactical decisions. Due to the epistemic uncertain nature of ...
The knowledge about available resources during highlevel synthesis is usually imprecise. Previous methods seem to have ignored this fact, possibly to avoid an increase in the, already high, computational complexity. In this paper an approach based on so called “‘possibilistic” programming, a kind of fuzzy mathematical programming, is presented. Using this method we can improve existing mathemcl...
We show that possibilistic quadratic programs with crisp decision variables and continuous fuzzy number coefficients are well-posed, i.e. small changes in the membership function of the coefficients may cause only a small deviation in the possibility distribution of the objective function.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید