نتایج جستجو برای: objective possibilistic programming
تعداد نتایج: 869300 فیلتر نتایج به سال:
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...
Fuzzy data given by expert knowledge can be regarded as a possibility distribution by which possibilistic linear systems are defined. Recently, it has become important to deal with fuzzy data in connection with expert knowledge. Three formulations of possibilistic linear regression analysis are proposed here to deal with fuzzy data. Since our formulations can be reduced to linear programming pr...
Possibility theory offers a qualitative framework for modeling decision under uncertainty. In this setting, pessimistic and optimistic decision criteria have been formally justified. The computation by means of possibilistic logic inference of optimal decisions according to such criteria has been proposed. This paper presents an Answer Set Programming (ASP)-based methodology for modeling decisi...
Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at object-language level. In P-DeLP, the closure of justified conclusions is not always consistent, which has been detected to be an anomaly in the context of so-called rationality postulates for rule-based argumentation systems...
Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty at object-language level. In P-DeLP, the closure of justified conclusions is not always consistent, which has been detected to be an anomaly in the context of so-called rationality postulates for rule-based argumentation systems...
An architecture for the implementation of possibilistic models in an object-oriented programming environment (C++ in particular) is described. Fundamental classes for special and general random sets, their associated fuzzy measures, special and general distributions and fuzzy sets, and possibilistic processes are speciied. Supplementary methods|including the fast MM obius transform, the maximum...
In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید