Solving Satisfiability in Fuzzy Logics by Mixing CMA-ES
Presented at the Genetic and Evolutionary Computation Conference
Satisfiability in propositional logic is well researched and many approaches to checking and solving exist. In infinite-valued or fuzzy logics, however, there have only recently been attempts at developing methods for solving satisfiability. In this paper, we propose new benchmark problems and analyse the function landscape of different problem classes, focussing our analysis on plateaus. Based on this study, we develop Mixing CMA-ES (M-CMA-ES), an extension to CMA-ES that is well suited to solving problems with many large plateaus. We empirically show the relation between certain function landscape properties and M-CMA-ES performance.
|C. Blum , E. Alba|
|Genetic and Evolutionary Computation Conference|
|Organisation||Intelligent and autonomous systems|
Brys, T, Drugan, M.M, Bosman, P.A.N, de Cock, M, & Nowé, A. (2013). Solving Satisfiability in Fuzzy Logics by Mixing CMA-ES. In C Blum & E Alba (Eds.), Proceedings of ACM Annual Genetic and Evolutionary Computation Conference 2013 (pp. 1125–1132). ACM.