Solving SAT Problem Based on Hybrid Differential Evolution Algorithm

DOI10.1007/978-3-642-04962-0_28MaRDI QIDQ3399958zbMATH OpenOpenAlexFDO

Authors

Publication date 15 January 2010

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04962-0_28

zbMATH Keywords

differential evolution algorithmhill-climbing algorithmhybrid differential evolution algorithmSAT problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)

Recommendations

• Solving the SAT problem based on evolutionary algorithm
• Hybrid evolutionary algorithm for solving optimization problems
• An improved differential evolution algorithm for solving constraint optimization problem
• Hybrid evolutionary algorithm for solving general variational inequality problems
• scientific article; zbMATH DE number 1961995

Cited in

(11)

• An artificial bee colony algorithm for solving SAT problem
• Solving SAT problems by orthogonal method
• Solving the SAT problem based on evolutionary algorithm
• Boosting SAT solver performance via a new hybrid approach
• scientific article; zbMATH DE number 1961995 (Why is no real title available?)
• Convergence properties of optimization algorithms for the SAT problem
• scientific article; zbMATH DE number 2040651 (Why is no real title available?)
• scientific article; zbMATH DE number 2090049 (Why is no real title available?)
• Parallel genetic algorithm for SAT problems based on OpenMP
• Artificial Evolution
• Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems

This page was built for publication: Solving SAT Problem Based on Hybrid Differential Evolution Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399958)