A genetic-based approach for satisfiability problems

DOI10.1007/3-540-45470-5_20MaRDI QIDQ4808720zbMATH OpenFDO

Authors Mohamed Ihsen Tounsi

Publication date 12 August 2004

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/2385/23850208.htm

zbMATH Keywords

Genetic AlgorithmHamiltonian CircuitNP-complete ProblemSAT

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A genetic algorithm for probabilistic SAT problem
• Solving SAT Problem Based on Hybrid Differential Evolution Algorithm
• VEGAS -- a new genetic algorithm for satisfiability
• On generic NP-completeness of the Boolean satisfiability problem
• Evolutionary computing for the satisfiability problem

Cited in

(3)

• GenB: A General Solver for AGM Revision
• scientific article; zbMATH DE number 5299689 (Why is no real title available?)
• A genetic algorithm for satisfiability problem in a probabilistic logic: A first report

This page was built for publication: A genetic-based approach for satisfiability problems

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