An enhanced fuzzy-genetic algorithm to solve satisfiability problems

José Francisco Saray Villamizar, Youakim Badr, Ajith Abraham

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

The satisfiability is a decision problem that belongs to NP-complete class and has significant applications in various areas of computer science. Several works have proposed high-performance algorithms and solvers to explore the space of variables and look for satisfying assignments. Pedrycz, Succi and Shai [1] have studied a fuzzy-genetic approach which demonstrates that a formula of variables can be satisfiable by assigning Boolean variables to partial true values between 0 and 1. In this paper we improve this approach by proposing an improved fuzzy-genetic algorithm to avoid undesired convergence of variables to 0.5. The algorithm includes a repairing function that eliminates the recursion and maintains a reasonable computational convergence and adaptable population generation. Implementation and experimental results demonstrate the enhancement of solving satisfiability problems.

Original languageEnglish (US)
Title of host publication11th International Conference on Computer Modelling and Simulation, UKSim 2009
Pages77-82
Number of pages6
DOIs
StatePublished - Sep 8 2009
Event11th International Conference on Computer Modelling and Simulation, UKSim 2009 - Cambridge, United Kingdom
Duration: Mar 25 2009Mar 27 2009

Publication series

Name11th International Conference on Computer Modelling and Simulation, UKSim 2009

Conference

Conference11th International Conference on Computer Modelling and Simulation, UKSim 2009
CountryUnited Kingdom
CityCambridge
Period3/25/093/27/09

Fingerprint

Fuzzy Algorithm
Satisfiability Problem
Genetic algorithms
Genetic Algorithm
Computer science
Recursion
Decision problem
Demonstrate
Computer Science
Assignment
Eliminate
NP-complete problem
High Performance
Enhancement
Partial
Experimental Results

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Modeling and Simulation

Cite this

Villamizar, J. F. S., Badr, Y., & Abraham, A. (2009). An enhanced fuzzy-genetic algorithm to solve satisfiability problems. In 11th International Conference on Computer Modelling and Simulation, UKSim 2009 (pp. 77-82). [4809741] (11th International Conference on Computer Modelling and Simulation, UKSim 2009). https://doi.org/10.1109/UKSIM.2009.106
Villamizar, José Francisco Saray ; Badr, Youakim ; Abraham, Ajith. / An enhanced fuzzy-genetic algorithm to solve satisfiability problems. 11th International Conference on Computer Modelling and Simulation, UKSim 2009. 2009. pp. 77-82 (11th International Conference on Computer Modelling and Simulation, UKSim 2009).
@inproceedings{6bd551e150a144c699eede00c1a5d19e,
title = "An enhanced fuzzy-genetic algorithm to solve satisfiability problems",
abstract = "The satisfiability is a decision problem that belongs to NP-complete class and has significant applications in various areas of computer science. Several works have proposed high-performance algorithms and solvers to explore the space of variables and look for satisfying assignments. Pedrycz, Succi and Shai [1] have studied a fuzzy-genetic approach which demonstrates that a formula of variables can be satisfiable by assigning Boolean variables to partial true values between 0 and 1. In this paper we improve this approach by proposing an improved fuzzy-genetic algorithm to avoid undesired convergence of variables to 0.5. The algorithm includes a repairing function that eliminates the recursion and maintains a reasonable computational convergence and adaptable population generation. Implementation and experimental results demonstrate the enhancement of solving satisfiability problems.",
author = "Villamizar, {Jos{\'e} Francisco Saray} and Youakim Badr and Ajith Abraham",
year = "2009",
month = "9",
day = "8",
doi = "10.1109/UKSIM.2009.106",
language = "English (US)",
isbn = "9780769535937",
series = "11th International Conference on Computer Modelling and Simulation, UKSim 2009",
pages = "77--82",
booktitle = "11th International Conference on Computer Modelling and Simulation, UKSim 2009",

}

Villamizar, JFS, Badr, Y & Abraham, A 2009, An enhanced fuzzy-genetic algorithm to solve satisfiability problems. in 11th International Conference on Computer Modelling and Simulation, UKSim 2009., 4809741, 11th International Conference on Computer Modelling and Simulation, UKSim 2009, pp. 77-82, 11th International Conference on Computer Modelling and Simulation, UKSim 2009, Cambridge, United Kingdom, 3/25/09. https://doi.org/10.1109/UKSIM.2009.106

An enhanced fuzzy-genetic algorithm to solve satisfiability problems. / Villamizar, José Francisco Saray; Badr, Youakim; Abraham, Ajith.

11th International Conference on Computer Modelling and Simulation, UKSim 2009. 2009. p. 77-82 4809741 (11th International Conference on Computer Modelling and Simulation, UKSim 2009).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An enhanced fuzzy-genetic algorithm to solve satisfiability problems

AU - Villamizar, José Francisco Saray

AU - Badr, Youakim

AU - Abraham, Ajith

PY - 2009/9/8

Y1 - 2009/9/8

N2 - The satisfiability is a decision problem that belongs to NP-complete class and has significant applications in various areas of computer science. Several works have proposed high-performance algorithms and solvers to explore the space of variables and look for satisfying assignments. Pedrycz, Succi and Shai [1] have studied a fuzzy-genetic approach which demonstrates that a formula of variables can be satisfiable by assigning Boolean variables to partial true values between 0 and 1. In this paper we improve this approach by proposing an improved fuzzy-genetic algorithm to avoid undesired convergence of variables to 0.5. The algorithm includes a repairing function that eliminates the recursion and maintains a reasonable computational convergence and adaptable population generation. Implementation and experimental results demonstrate the enhancement of solving satisfiability problems.

AB - The satisfiability is a decision problem that belongs to NP-complete class and has significant applications in various areas of computer science. Several works have proposed high-performance algorithms and solvers to explore the space of variables and look for satisfying assignments. Pedrycz, Succi and Shai [1] have studied a fuzzy-genetic approach which demonstrates that a formula of variables can be satisfiable by assigning Boolean variables to partial true values between 0 and 1. In this paper we improve this approach by proposing an improved fuzzy-genetic algorithm to avoid undesired convergence of variables to 0.5. The algorithm includes a repairing function that eliminates the recursion and maintains a reasonable computational convergence and adaptable population generation. Implementation and experimental results demonstrate the enhancement of solving satisfiability problems.

UR - http://www.scopus.com/inward/record.url?scp=69649092586&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69649092586&partnerID=8YFLogxK

U2 - 10.1109/UKSIM.2009.106

DO - 10.1109/UKSIM.2009.106

M3 - Conference contribution

AN - SCOPUS:69649092586

SN - 9780769535937

T3 - 11th International Conference on Computer Modelling and Simulation, UKSim 2009

SP - 77

EP - 82

BT - 11th International Conference on Computer Modelling and Simulation, UKSim 2009

ER -

Villamizar JFS, Badr Y, Abraham A. An enhanced fuzzy-genetic algorithm to solve satisfiability problems. In 11th International Conference on Computer Modelling and Simulation, UKSim 2009. 2009. p. 77-82. 4809741. (11th International Conference on Computer Modelling and Simulation, UKSim 2009). https://doi.org/10.1109/UKSIM.2009.106