TY - JOUR
T1 - Truth-Preservation under Fuzzy pp-Formulas
AU - Dellunde, Pilar
AU - Vidal, Amanda
N1 - Publisher Copyright:
© 2019 World Scientific Publishing Company.
Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.
PY - 2019/12/1
Y1 - 2019/12/1
N2 - How can non-classical logic contribute to the analysis of complexity in computer science? In this paper, we give a step towards this question, 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 this kind of sentences in terms of homomorphisms and 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.
AB - How can non-classical logic contribute to the analysis of complexity in computer science? In this paper, we give a step towards this question, 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 this kind of sentences in terms of homomorphisms and 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.
KW - Fuzzy constraint satisfaction
KW - fuzzy logics
KW - model theory
UR - http://www.scopus.com/inward/record.url?scp=85074657236&partnerID=8YFLogxK
U2 - 10.1142/S0218488519400051
DO - 10.1142/S0218488519400051
M3 - Article
AN - SCOPUS:85074657236
VL - 27
SP - 89
EP - 105
JO - International Journal of Uncertainty, Fuzziness and Knowlege-Based Systems
JF - International Journal of Uncertainty, Fuzziness and Knowlege-Based Systems
SN - 0218-4885
IS - Suppl.1
ER -