Computational complexities of axiomatic extensions of monoidal t-norm based logic

From MaRDI portal
Publication:2391235

DOI10.1007/S00500-008-0382-0zbMATH Open1176.03009OpenAlexW1966849599MaRDI QIDQ2391235FDOQ2391235


Authors: Moataz El-Zekey, Wafik Boulos Lotfallah, Nehad N. Morsi Edit this on Wikidata


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




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Computational complexities of axiomatic extensions of monoidal t-norm based logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391235)