Universitat Autònoma de Barcelona
Altres ajuts: RASO TIN2015-71799-C2-1-P
Altres ajuts: CIMBVAL TIN2017-89758-R
Can non-classical logic contribute to the analysis of complexity in computer science? In this paper, we give an step towards the solution of this open problem, taking a logical model-theoretic approach to the analysis of complexity in fuzzy constraint satisfaction. We study fuzzy positive-primitive sentences, and we present an algebraic characterization of classes axiomatized by these kind of sentences in terms of homomorphisms and finite direct products. The ultimate goal is to study the expressiveness and reasoning mechanisms of non-classical languages, with respect to constraint satisfaction problems and, in general, in modelling decision scenarios
Working paper
English
Fuzzy constraint satisfaction; Preference modeling; Fuzzy logics; Model theory
European Commission 689176
Agència de Gestió d'Ajuts Universitaris i de Recerca 2017/SGR-172
open access
Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, i la comunicació pública de l'obra, sempre que no sigui amb finalitats comercials, i sempre que es reconegui l'autoria de l'obra original. No es permet la creació d'obres derivades.
https://creativecommons.org/licenses/by-nc-nd/4.0/
Working papers [2870]
