Evolutionary computing for the satisfiability problem

DOI10.1007/3-540-36605-9_24MaRDI QIDQ4418385zbMATH OpenFDO

Authors Jin-Kao Hao, Frédéric Lardeux, Frédéric Saubion

Publication date 10 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2611/26110258.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Solving the SAT problem based on evolutionary algorithm
• Solving SAT Problem Based on Hybrid Differential Evolution Algorithm
• Recombination operators for satisfiability problems
• A genetic algorithm for probabilistic SAT problem
• VEGAS -- a new genetic algorithm for satisfiability

Cited in

(12)

• PLAtestGA: A CNF-satisfiability problem for the generation of test vector for missing faults in VLSI circuits
• Solving SAT Problem Based on Hybrid Differential Evolution Algorithm
• VEGAS -- a new genetic algorithm for satisfiability
• Solving the SAT problem based on evolutionary algorithm
• Evolving Variable-Ordering Heuristics for Constrained Optimisation
• ERA: An algorithm for reducing the epistasis of SAT problems
• A genetic-based approach for satisfiability problems
• An evolutionary local search method for incremental satisfiability
• scientific article; zbMATH DE number 5044617 (Why is no real title available?)
• Recombination operators for satisfiability problems
• A competitive and cooperative approach to propositional satisfiability
• Scatter search and genetic algorithms for MAX-SAT problems

Describes a project that uses

Uses Software

• UnitWalk
• Chaff
• SATO

This page was built for publication: Evolutionary computing for the satisfiability problem

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