SITE TREE
About IIIA
Departments
Research
Technology Transfer
People
Activities
Library
Monographs
Join Us
New Publications
A time series dissimilarity measure based on minimum jump costs
Non-associative substructural logics and their semilinear extensions: axiomatization and completeness properties
Unsupervised music structure annotation by time series structure features and segment similarity
Folksonomy-based tag recommendation for collaborative tagging systems
The quest for the basic fuzzy logic
t-DeLP: an argumentation-based Temporal Defeasible Logic Programming framework
Logics for belief functions on MV-algebras
Català
English
Español
Home
Contact
Web Map
LOGIN
Publications
The coherence of Lukasiewicz assessments is NP-complete
Coherence
Computational Complexity
modal fuzzy logic
NP-completeness
Publication Type:
Journal Article
Authors:
Simone Bova
;
Tommaso Flaminio
Source:
International Journal of Approximate reasoning, Volume 51, Issue 3, p.294--304 (2010)
Keywords:
Computational Complexity
;
NP-completeness
Tagged
XML
BibTex
»
Printer-friendly version
eMail to friend
desarrollo web innodus