Exploring extensions of possibilistic logic over gödel logic

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 composed of non-modal and modal formulas, the latter moreover not allowing for nested applications of the modal operator N. Besides, a full fuzzy modal logic for graded necessity over Gödel logic is also introduced together with an algebraic semantics, the class of NG-algebras. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Dellunde, P., Godo, L., & Marchioni, E. (2009). Exploring extensions of possibilistic logic over gödel logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5590 LNAI, pp. 923–934). https://doi.org/10.1007/978-3-642-02906-6_79

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free