scientific article; zbMATH DE number 6276275
From MaRDI portal
Publication:5406041
Recommendations
- Computational complexity of t-norm based propositional fuzzy logics with rational truth constants
- Complexity of fuzzy probability logics. II
- Some Complexity Results on Fuzzy Description Logics
- scientific article; zbMATH DE number 1081154
- Arithmetical complexity of fuzzy predicate logics -- a survey
- scientific article; zbMATH DE number 6276276
- On fuzzification of propositional logics
- scientific article; zbMATH DE number 3995647
- Fuzzy Propositional Configuration Logics
Cited in
(16)- Complexity of some language fragments of fuzzy logics
- Skolemization and Herbrand theorems for lattice-valued logics
- Implicit definability of truth constants in Łukasiewicz logic
- Complexity of fuzzy probability logics. II
- Complexity of fuzzy probability logics
- Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras
- scientific article; zbMATH DE number 5005394 (Why is no real title available?)
- Paraconsistency properties in degree-preserving fuzzy logics
- Some Complexity Results on Fuzzy Description Logics
- Complexity of fuzzy answer set programming under Łukasiewicz semantics
- On decidability of concept satisfiability in description logic with product semantics
- A first polynomial non-clausal class in many-valued logic
- Rational Pavelka logic: the best among three worlds?
- The MaxSAT problem in the real-valued MV-algebra
- Superabelian logics
- On the local modal product logic: standard completeness and decidability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406041)
