Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae.
Domenico CantoneAndrea De DomenicoPietro MaugeriEugenio G. OmodeoPublished in: CoRR (2021)
Keyphrases
- set theory
- boolean formulae
- first order logic
- computational complexity
- boolean variables
- expressive power
- fuzzy set theory
- fuzzy logic
- objective function
- partial order
- description logics
- fuzzy sets
- neural network
- rough sets
- rough set theory
- pattern recognition
- search algorithm
- linear constraints
- image processing
- artificial intelligence
- genetic algorithm