On Finitely Valued Fuzzy Description Logics: The Łukasiewicz Case
نویسندگان
چکیده
Following the guidelines proposed by Hájek in [1], some proposals of research on Fuzzy Description Logics (FDLs) were given in [2]. One of them consists in the definition and development of a family of description languages, each one having as underlying fuzzy logic the expansion with an involutive negation and truth constants of the logic defined by a divisible finite t-norm. A general framework for finitely valued FDLs was presented in [3]. In the present paper we study the family of languages ALC Ln based on the finitely valued Lukasiewicz logics with truth constants. In addition, we provide an interpretation of these FDLs into fuzzy multi-modal systems. We also deal with the corresponding reasoning tasks and their relationships, and we report some results on decidability and computational complexity.
منابع مشابه
The Complexity of Subsumption in Fuzzy EL
Fuzzy Description Logics (DLs) are used to represent and reason about vague and imprecise knowledge that is inherent to many application domains. It was recently shown that the complexity of reasoning in finitely valued fuzzy DLs is often not higher than that of the underlying classical DL. We show that this does not hold for fuzzy extensions of the light-weight DL EL, which is used in many bio...
متن کاملThe complexity of fuzzy EL under the Łukasiewicz T-norm
Fuzzy Description Logics (DLs) are are a family of knowledge representation formalisms designed to represent and reason about vague and imprecise knowledge that is inherent to many application domains. Previous work has shown that the complexity of reasoning in a fuzzy DL using finitely many truth degrees is usually not higher than that of the underlying classical DL. We show that this does not...
متن کاملConjunctive Query Answering in Finitely-Valued Fuzzy Description Logics
Fuzzy Description Logics (DLs) generalize crisp ones by providing membership degree semantics for concepts and roles. A popular technique for reasoning in fuzzy DL ontologies is by providing a reduction to crisp DLs and then employ reasoning in the crisp DL. In this paper we adopt this approach to solve conjunctive query (CQ) answering problems for fuzzy DLs. We give reductions for Gödel, and Ł...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملOn the relationship between fuzzy autoepistemic logic and fuzzy modal logics of belief
Autoepistemic logic is an important formalism for nonmonotonic reasoning originally intended to model an ideal rational agent reflecting upon his own beliefs. Fuzzy autoepistemic logic is a generalization of autoepistemic logic that allows to represent an agent’s rational beliefs on gradable propositions. It has recently been shown that, in the same way as autoepistemic logic generalizes answer...
متن کامل