01-09-2009 | Original Paper
Computational complexities of axiomatic extensions of monoidal t-norm based logic
Published in: Soft Computing | Issue 11/2009
Log inActivate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by