Paper Info
Title
Fuzzy Positive Primitive Formulas.
Abstract
Can non-classical logic contribute to the analysis of complexity in computer science? In this paper, we give a 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 this 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.
Year
Venue
Field
2018
MDAI
Open problem,Algebraic number,Computer science,Fuzzy logic,Theoretical computer science,Constraint satisfaction problem,Homomorphism,Artificial intelligence,Model theory,Machine learning,Expressivity,Fuzzy constraint satisfaction
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Pilar Dellunde115622.63