Satisfiability solving in fuzzy logics is a subject that has not been researched much, certainly compared to satisfiability in propositional logics. Yet, fuzzy logics are a powerful tool for modelling complex problems. Recently, we proposed an optimization approach to solving satisfiability in fuzzy logics and compared the standard Covariance Matrix Adaptation Evolution Strategy algorithm (CMA-ES) with an analytical solver on a set of benchmark problems. Especially on more finegrained problems did CMA-ES compare favourably to the analytical approach. In this paper, we evaluate two types of hillclimber in addition to CMA-ES, as well as restart strategies for these algorithms. Our results show that a population-based hillclimber outperforms CMA-ES on the harder problem class.
|Title of host publication||2013 IEEE International Workshop on Genetic and Evolutionary Fuzzy Systems (GEFS), 16-19 April 2013, Singapore|
|Place of Publication||Piscataway|
|Publisher||Institute of Electrical and Electronics Engineers|
|Publication status||Published - 2013|
Brys, T., Drugan, M. M., De Cock, M., Bosman, P. A. N., & Nowe, A. (2013). Local search and restart strategies for satisfiability solving in fuzzy logics. In 2013 IEEE International Workshop on Genetic and Evolutionary Fuzzy Systems (GEFS), 16-19 April 2013, Singapore (pp. 52-59). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/GEFS.2013.6601055