On the failure of the finite model property in some fuzzy description logics
From MaRDI portal
Publication:549343
Abstract: Fuzzy Description Logics (DLs) are a family of logics which allow the representation of (and the reasoning with) structured knowledge affected by vagueness. Although most of the not very expressive crisp DLs, such as ALC, enjoy the Finite Model Property (FMP), this is not the case once we move into the fuzzy case. In this paper we show that if we allow arbitrary knowledge bases, then the fuzzy DLs ALC under Lukasiewicz and Product fuzzy logics do not verify the FMP even if we restrict to witnessed models; in other words, finite satisfiability and witnessed satisfiability are different for arbitrary knowledge bases. The aim of this paper is to point out the failure of FMP because it affects several algorithms published in the literature for reasoning under fuzzy ALC.
Recommendations
- On the (un)decidability of fuzzy description logics under Łukasiewicz t-norm
- Finite fuzzy description logics and crisp representations
- On finitely valued fuzzy description logics: the Łukasiewicz case
- How fuzzy is my fuzzy description logic?
- The complexity of fuzzy \(\mathcal{EL}\) under the Łukasiewicz t-norm
Cites work
- scientific article; zbMATH DE number 5356404 (Why is no real title available?)
- scientific article; zbMATH DE number 67503 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 5040084 (Why is no real title available?)
- Attributive concept descriptions with complements
- Computational complexity of t-norm based propositional fuzzy logics with rational truth constants
- Fuzzy description logics and \(t\)-norm based fuzzy logics
- Fuzzy description logics with general t-norms and datatypes
- Fuzzy sets
- Making fuzzy description logic more general
- Mechanizing Mathematical Reasoning
- Metamathematics of fuzzy logic
- Modal logic
- On witnessed models in fuzzy logic
- Reasoning and revision in hybrid representation systems
- Reasoning within fuzzy description logics
- The complexity of McNaughton functions of one variable
Cited in
(14)- MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions
- On the decidability status of fuzzy \(\mathcal {A}\mathcal {L}\mathcal {C}\) with general concept inclusions
- On the undecidability of fuzzy description logics with GCIs and product t-norm
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
- A note on the model-theoretic semantics of fuzzy logic programming for dealing with inconsistency
- The limits of decidability in fuzzy description logics with general concept inclusions
- Fuzzy description logics and \(t\)-norm based fuzzy logics
- Consistency reasoning in lattice-based fuzzy description logics
- From fuzzy to annotated semantic web languages
- All about fuzzy description logics and applications
- Optimising fuzzy description logic reasoners with general concept inclusion absorption
- Complexity of fuzzy answer set programming under Łukasiewicz semantics
- On the (un)decidability of fuzzy description logics under Łukasiewicz t-norm
- Model checking fuzzy computation tree logic
This page was built for publication: On the failure of the finite model property in some fuzzy description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549343)