نتایج جستجو برای: objective possibilistic programming

تعداد نتایج: 869300  

2017

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

2015
Didier Dubois Henri Prade Steven Schockaert

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

2004
Carlos Iván Chesñevar Guillermo Ricardo Simari Teresa Alsinet Lluis Godo

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

2005
Carlos Iván Chesñevar Guillermo Ricardo Simari Lluis Godo Teresa Alsinet

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

2005
Carlos Iván Chesñevar Guillermo Ricardo Simari Lluis Godo Teresa Alsinet

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

2005
Carlos Iván Chesñevar Guillermo Ricardo Simari Lluis Godo Teresa Alsinet

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

Journal: :Forests 2021

In recent decades, the forest industry has been growingly expanded due to economic conditions, climate changes, environmental and energy policies, intense demand changes. Thus, appropriate planning is required improve this industry. To achieve economic, social goals, a supply chain network designed based on multi-period multi-product Mixed-Integer Non-Linear Programming (MINLP) model in which o...

Journal: :Operational Research 2022

Abstract This paper addresses a multi-objective blood supply chain network design, considering economic and environmental aspects. The objective of this model is to simultaneously minimize operational cost its logistical carbon footprint. In order embed the uncertainty transportation costs, demand, capacity facilities emission, novel robust possibilistic-necessity optimization used regarding hy...

Journal: :Computers & Mathematics with Applications 2008

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید