## A temporal semantics for Nilpotent Minimum logic

- Matteo Bianchi
- Int. J. Approx. Reasoning
- 2014

@article{ElZekey2009ComputationalCO, title={Computational complexities of axiomatic extensions of monoidal t-norm based logic}, author={Moataz Saleh El-Zekey and Wafik Boulos Lotfallah and Nehad N. Morsi}, journal={Soft Comput.}, year={2009}, volume={13}, pages={1089-1097} }

- Published 2009 in Soft Comput.
DOI:10.1007/s00500-008-0382-0

We study the computational complexity of some axiomatic extensions of the monoidal t-norm based logic (MTL), namely NM corresponding to the logic of the socalled nilpotent minimum t-norm (due to Fodor in Fuzzy Sets Syst 69:141–156, 1995); and SMTL corresponding to leftcontinuous strict t-norms, introduced by Esteva (and others) (Fuzzy Sets Syst 132(1):107… CONTINUE READING

### Presentations referencing similar topics