A genetic algorithm for probabilistic SAT problem

DOI10.1007/978-3-540-24844-6_68MaRDI QIDQ4666424zbMATH OpenOpenAlexFDO

Authors Uroš Midić, Jozef Kratica, Zoran Ognjanović

Publication date 12 April 2005

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

Full work available at URL https://doi.org/10.1007/b98109

Mathematics Subject Classification ID

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

Recommendations

• A genetic algorithm for satisfiability problem in a probabilistic logic: A first report
• Generalized probabilistic satisfiability
• VEGAS -- a new genetic algorithm for satisfiability
• Probabilistic performance of a heurisic for the satisfiability problem
• scientific article; zbMATH DE number 69384

Cited in

(13)

• Generalized probabilistic satisfiability
• Automated non-monotonic reasoning in System \textbf{P}
• Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities
• VEGAS -- a new genetic algorithm for satisfiability
• Solving the SAT problem based on evolutionary algorithm
• Evolutionary computing for the satisfiability problem
• ERA: An algorithm for reducing the epistasis of SAT problems
• A DNA-based random walk method for solving k-SAT
• A genetic algorithm for satisfiability problem in a probabilistic logic: A first report
• A genetic-based approach for satisfiability problems
• scientific article; zbMATH DE number 6172805 (Why is no real title available?)
• A hybrid method for probabilistic satisfiability
• Recombination operators for satisfiability problems

This page was built for publication: A genetic algorithm for probabilistic SAT problem

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