Skip to search formSkip to main contentSkip to account menu

Monoidal t-norm logic

Known as: MTL, MTL (logic), Monoidal t-norm based logic 
Monoidal t-norm based logic (or shortly MTL), the logic of left-continuous t-norms, is one of t-norm fuzzy logics. It belongs to the broader class of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Atomic formulaBL (logic)Fuzzy mathematicsLogical connective

Broader (1)

Fuzzy logic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Pseudo-task Augmentation: From Deep Multitask Learning to Intratask Sharing - and Back
Deep multitask learning boosts performance by sharing learned structure across related tasks. This paper adapts ideas from deep… 
2018
2018
The aLS-SVM based multi-task learning classifiers
The multi-task learning support vector machines (SVMs) have recently attracted considerable attention since the conventional… 
Highly Cited
2016
Highly Cited
2016
Deep Multi-task Representation Learning: A Tensor Factorisation Approach
Most contemporary multi-task learning methods assume linear models. This setting is considered shallow in the era of deep… 
2010
2010
Kripke-Style Semantics for Non-Commutative Monoidal t-Norm Logic
A t-norm is a binary operation on [0, 1] that is associative, commutative, with identity 1 and non-decreasing in both argument… 
Highly Cited
2010
Highly Cited
2010
Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
2004
2004
On eliminating crosstalk within multiconductor transmission lines
This letter presents a concept of total elimination of crosstalk between signals propagating in multiconductor transmission lines… 
Highly Cited
2002
Highly Cited
2002
On the Standard and Rational Completeness of some Axiomatic Extensions of the Monoidal T-norm Logic
The monoidal t-norm based logic MTL is obtained from Hájek's Basic Fuzzy logic BL by dropping the divisibility condition for the… 
Highly Cited
2002
Highly Cited
2002
Kripke Semantics, Undecidability and Standard Completeness for Esteva and Godo's Logic MTL∀
The present paper deals with the predicate version MTL∀ of the logic MTL by Esteva and Godo. We introduce a Kripke semantics for… 
Highly Cited
1996
Highly Cited
1996
The Parallel Transfer of Task Knowledge Using Dynamic Learning Rates Based on a Measure of Relatedness
With a distinction made between two forms of task knowledge transfer, 'representational' and 'functional', eta MTL, a modified… 
1995
1995
Differential-difference equations for the transient simulation of lossy MTLs
In this paper, we address the differential representation of the time-domain characteristics of lossy MTLs. This approach is of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)