Extending possibilistic logic over Gödel logic
نویسندگان
چکیده
In this paper we present several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. Based on different characterizations of necessity measures on fuzzy sets, a group of logics with Kripke style semantics are built over a restricted language, namely a two level language composed of non-modal and modal formulas, the latter moreover not allowing for nested applications of the modal operator N . Completeness and some computational complexity results are shown.
منابع مشابه
Formalizing argumentative reasoning in a possibilistic 3 logic programming setting with fuzzy unification q
12 Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from 13 argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-lan14 guage level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot 15 be expressed in the object la...
متن کاملFormalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-language level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot be expressed in the object language. One ...
متن کاملExploring Extensions of Possibilistic Logic over Gödel Logic
In this paper we present completeness results of several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. In a first attempt, based on different characterizations of necessity measures on fuzzy sets, a group of logics, with Kripke style semantics, are built over a restricted language, indeed a two level language compose...
متن کاملAn Extension of Gödel Logic for Reasoning under Both Vagueness and Possibilistic Uncertainty
In this paper we introduce a logic called FNG∼(Q) that combines the well-known Gödel logic with a strong negation, rational truthconstants and Possibilistic logic. In this way, we can formalize reasoning involving both vagueness and (possibilistic) uncertainty. We show that the defined logical system is useful to capture the kind of reasoning at work in the medical diagnosis system CADIAG-2, an...
متن کاملPossibilistic Semantics for a Modal KD45 Extension of Gödel Fuzzy Logic
In this paper we provide a simplified semantics for the logic KD45(G), i.e. the many-valued Gödel counterpart of the classical modal logic KD45. More precisely, we characterize KD45(G) as the set of valid formulae of the class of possibilistic Gödel Kripke Frames 〈W,π〉, where W is a non-empty set of worlds and π : W → [0, 1] is a normalized possibility distribution on W .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 52 شماره
صفحات -
تاریخ انتشار 2011