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...

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. Solving a P-DeLP query Q accounts for performing an exhaustive analysis of arguments and defeaters for Q, resulting in a so-calle...

The design of closed-loop supply chain networks has attracted increasing attention in recent decades with environmental concerns and commercial factors. Due to the rapid growth of knowledge and technology, the complexity of the supply chain operations is increasing daily and organizations are faced with numerous challenges and risks in their management. Most organizations with limited resources...

Mathematical programming plays a pivotal role in finding the solution for optimization problems in various practical, real-life applications. Conventionally, the modeling used in mathematical programming is based on numerical values. It is however complicated to accurately provide such rigid numerical values because uncertain elements do exist in the decision-making process. Furthermore, buildi...

Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this aim, knowledge is represented by a normal logic program where each rule is given with its own degree of certainty. By this way, it formally defines a distribution of possibility over atom sets that, on its turn, induce...

Possibilistic Defeasible Logic Programming (\Pdelp) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at object-language level. The aim of this paper is twofold: first to present an approach towards extending \Pdelp in order to incorporate fuzzy constants and fuzzy unification, and af...