Inferring Preferred Extensions by Pstable Semantics
نویسندگان
چکیده
منابع مشابه
Inferring preferred extensions by Pstable semantics
When Dung introduced his argumentation approach, he proved that it can be regarded as a special form of logic programming with negation as failure. In fact, he showed that the grounded and stable semantics can be characterized by the well-founded and stable model semantics respectively. However, Dung did not give any characterization of the preferred semantics in terms of logic programming sema...
متن کاملInferring Preferred Extensions by Minimal Models
We identify that there is a direct relationship between the minimal models of a propositional formula and the preferred extensions of an argumentation framework. Then we show how to infer the preferred extensions of an argumentation framework by using UNSAT algorithms and disjunctive answer set solvers.
متن کاملPreferred Extensions as Minimal Models of Clark's Completion Semantics
Dung established the connections between several logic programming semantics and various argumentation framework semantics. In this paper we present a characterization of the preferred semantics of argumentation frameworks (which is defined in terms of a maximal admissible set w.r.t. set inclusion) in terms of minimal logic models of Clark’s completion. Additionally, we make use of integer prog...
متن کاملPStable Semantics for Possibilistic Logic Programs
Uncertain information is present in many real applications e.g., medical domain, weather forecast, etc. The most common approaches for leading with this information are based on probability however some times; it is difficult to find suitable probabilities about some events. In this paper, we present a possibilistic logic programming approach which is based on possibilistic logic and PStable se...
متن کاملExpressing the Stable Semantics in Terms of the Pstable Semantics
We show that with a simple translation for normal programs, we can use the pstable model semantics to get the stable models of a normal program. We present the formal proof of this statement.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTELIGENCIA ARTIFICIAL
سال: 2009
ISSN: 1988-3064
DOI: 10.4114/ia.v13i41.1029