Metadata language
Genetic - fuzzy approach to the boolean satisfiability problem
Subtitle:Raport Badawczy = Research Report ; RB/57/2001
Creator:Pedrycz, Witold (1953– ) ; Shai, Ofer ; Succi, Giancarlo
Publisher:Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
Place of publishing: Date issued/created: Description:21 pages ; 21 cm ; Bibliography p. 21
Subject and Keywords:Fuzzy sets ; Zbiory rozmyte ; Fuzzy functions ; Funkcja przynależności
Abstract:This study concerns with the Boolean satisfiability (SAT) problem and its solution in the setting of a hybrid computational intelligence environment of genetic and fuzzy computing. In this tramework, fuzzy sets realize an embedding principle meaning that original two-values (Boolean) functions under investigation are extended to their continuous counterparts resulting in the form of fuzzy (multivalued) functions. In the sequel, the satisfiability problem is reformulated for the fuzzy functions and solved using a genetic algorithm (GA). It is shown that a GA, especially its recursive version, is an efficient tool for handling multivariable SAT problems. Thorough experiments revealed that the recursive version of the GA can solve SAT problems with more than 1000 variables.
Relation:Raport Badawczy = Research Report
Resource type: Detailed Resource Type: Source: Language: Language of abstract: Rights:Creative Commons Attribution BY 4.0 license
Terms of use:Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -
Digitizing institution:Systems Research Institute of the Polish Academy of Sciences
Original in:Library of Systems Research Institute PAS
Projects co-financed by: Access: