Computational complexities of axiomatic extensions of monoidal t-norm based logic
DOI10.1007/s00500-008-0382-0zbMath1176.03009MaRDI QIDQ2391235
Nehad N. Morsi, Moataz El-Zekey, Wafik Boulos Lotfallah
Publication date: 24 July 2009
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-008-0382-0
computational complexity; tautology; nilpotent minimum t-norm; axiomatic extension of monoidal t-norm-based logic; left-continuous strict t-norm; NM; satisfiable formula; SMTL
68Q25: Analysis of algorithms and problem complexity
03B52: Fuzzy logic; logic of vagueness
03D15: Complexity of computation (including implicit computational complexity)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- NMŁ, a schematic extension of F. Esteva and L. Godo's logic MTL
- Complexity issues in Basic Logic
- Metamathematics of fuzzy logic
- Monoidal t-norm based logic: Towards a logic for left-continuous t-norms
- Basic fuzzy logic and BL-algebras. II
- On equivalent forms of fuzzy logic systems NM and IMTL
- A proof of standard completeness for Esteva and Godo's logic MTL
- On the standard and rational completeness of some axiomatic extensions of the monoidal t-norm logic
- A general method for constructing left-continuous t-norms
- On a class of left-continuous \(\text t\)-norms
- \(R _{0}\) implication: Characteristics and applications
- Observations on the monoidal t-norm logic
- A characterization of truth-functions in the nilpotent minimum logic
- Contrapositive symmetry of fuzzy implications
- On expansions of WNM t-norm based logics with truth-constants
- On triangular norm based axiomatic extensions of the weak nilpotent minimum logic
- On Fuzzy Logic I Many‐valued rules of inference
- Complexity of t-tautologies
