A survey of the satisfiability-problems solving algorithms

Authors:
Yousef Kilani;Mohammad Bsoul;Ayoub Alsarhan;Ahmad Al-Khasawneh
Affiliations:
Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, Hashemite University, Alzarqa, Jordan;Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, Hashemite University, Alzarqa, Jordan;Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, Hashemite University, Alzarqa, Jordan;Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology, Hashemite University, Alzarqa, Jordan
Venue:
International Journal of Advanced Intelligence Paradigms
Year:
2013

Citing 70
Cited 0

Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Trap escaping strategies in discrete Lagrangian methods for solving hard satisfiability and maximum satisfiability problems

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
An Introduction to Genetic Algorithms

An Introduction to Genetic Algorithms
Boosting complete techniques thanks to local search methods

Annals of Mathematics and Artificial Intelligence
An algorithm based on tabu search for satisfiability problem

Journal of Computer Science and Technology
Evolutionary algorithms for the satisfiability problem

Evolutionary Computation
A Hybrid Approach for SAT

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
CVC: A Cooperating Validity Checker

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
Reducing search space in local search for constraint satisfaction

Eighteenth national conference on Artificial intelligence
Enhancing Davis Putnam with extended binary clause reasoning

Eighteenth national conference on Artificial intelligence
An adaptive noise mechanism for walkSAT

Eighteenth national conference on Artificial intelligence
Solving Hard Satisfiability Problems: A Unified Algorithm Based on Discrete Lagrange Multipliers

ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Improving Nogood Recording Using 2SAT

ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
On SAT Instance Classes and a Method for Reliable Performance Experiments with SAT Solvers

Annals of Mathematics and Artificial Intelligence
GASAT: a genetic local search algorithm for the satisfiability problem

Evolutionary Computation
Clause Weighting Local Search for SAT

Journal of Automated Reasoning
A new hybrid solution to boost SAT solver performance

Proceedings of the conference on Design, automation and test in Europe
Performance testing of combinatorial solvers with isomorph class instances

Proceedings of the 2007 workshop on Experimental computer science
The island confinement method for reducing search space in local search methods

Journal of Heuristics
Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources

Natural Computing: an international journal
A survey on metaheuristics for stochastic combinatorial optimization

Natural Computing: an international journal
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Extending SAT Solvers to Cryptographic Problems

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Beyond CNF: A Circuit-Based QBF Solver

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Complete local search for propositional satisfiability

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Old resolution meets modern SLS

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
DC-SSAT: a divide-and-conquer approach to solving stochastic satisfiability problems efficiently

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Protein structure prediction on the face centered cubic lattice by local search

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A new clause learning scheme for efficient unsatisfiability proofs

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
SATzilla: portfolio-based algorithm selection for SAT

Journal of Artificial Intelligence Research
GUNSAT: a greedy local search algorithm for unsatisfiability

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The effect of restarts on the efficiency of clause learning

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A structure-based variable ordering heuristic for SAT

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems

Applied Soft Computing
The exponentiated subgradient algorithm for heuristic Boolean programming

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
SATenstein: automatically building local search SAT solvers from components

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Integrating systematic and local search paradigms: a new strategy for MaxSAT

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
OEA_SAT: an organizational evolutionary algorithm for solving satisfiability problems

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Combining adaptive noise and look-ahead in local search for SAT

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Sensor deployment for failure diagnosis in networked aerial robots: a satisfiability-based approach

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
CVC3

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources

Theoretical Computer Science
Advances in local search for satisfiability

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Attacking Bivium using SAT solvers

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Improvements to hybrid incremental SAT algorithms

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Local restarts

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Speeding up Local Search By Using the Island Confinement Method

Speeding up Local Search By Using the Island Confinement Method
A new method for solving hard satisfiability problems

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Towards an understanding of hill-climbing procedures for SAT

AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Evidence for invariants in local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Spiking neural P systems with neuron division

CMC'10 Proceedings of the 11th international conference on Membrane computing
Satisfiability of acyclic and almost acyclic CNF formulas (II)

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A symbolic search based approach for quantified boolean formulas

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Effective preprocessing in SAT through variable and clause elimination

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Diversification and determinism in local search for satisfiability

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Statistical methodology for comparison of SAT solvers

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Improved local search for circuit satisfiability

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
An evolutionary local search algorithm for the satisfiability problem

TAINN'05 Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks
Applications of SAT solvers to cryptanalysis of hash functions

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Local search for unsatisfiability

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Solving NP-Complete problems by spiking neural p systems with budding rules

WMC'09 Proceedings of the 10th international conference on Membrane Computing
Spiking Neural P Systems

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The propositional satisfiability SAT problem is one of the most fundamental problems in computer science. SAT solvers have been successfully applied to a wide range of practical applications, including hardware model checking, software model finding, equivalence checking, and planning, among many others. Empirical research has been very fruitful for the development of efficient methods for SAT problems, such as classical Davis-Putnam method, greedy SAT GSAT method and neural network SAT method. This paper gives a survey about the methods used for solving the SAT problems with an emphasis on surveying the local search algorithms.