Asynchronous team algorithms for Boolean Satisfiability

  title={Asynchronous team algorithms for Boolean Satisfiability},
  author={Carlos Rodr{\'i}guez and Marcos Villagra and Benjam{\'i}n Bar{\'a}n},
  journal={2007 2nd Bio-Inspired Models of Network, Information and Computing Systems},
The Boolean Satisfiability Problem or SAT is one of the most important problems in computer science. Nowadays, there are different types of algorithms to solve instances with thousands of variables, and much research is being carried out looking for more efficient algorithms to solve larger and harder instances. This work proposes the utilization of a Team Algorithm (TA) strategy combining different local search algorithms for SAT as WalkSAT, R-Novelty+, Adaptive Novelty+, RSAPS, IROTS and SAMD… 

Tables from this paper

MOP2P: Peer-to-peer platform applied to multiobjective optimization problems
A platform (denominated MOP2P) that allows the distributed execution of metaheuristic based algorithms for solving MOP using computers connected in a network in order to handle more computing power according to current demand is presented.
Markets are Efficient if and Only if P = NP
I prove that if markets are efficient, meaning current prices fully reflect all information available in past prices, then P=NP, meaning every computational problem whose solution can be verified in
Data Security in Distributed System Using Fully Homomorphic Encryption and Linear
In present system, robust design with perfect security constraints is implemented, also Linear Programming Condition and Fully Homomorphic encryption technique are implemented.


Iterated Robust Tabu Search for MAX-SAT
This paper presents a new stochastic local search (SLS) algorithm for MAX-SAT that combines Iterated Local Search and Tabu Search, two well-known SLS methods that have been successfully applied to many other combinatorial optimisation problems.
On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT
  • H. Hoos
  • Computer Science, Mathematics
  • 1999
The notion of incompleteness for stochastic decision algorithms is refined by introducing the notion of "probabilistic asymptotic completeness" (PAC) and it is proved for a number of well-known SLS algorithms whether or not they have this property.
Local search strategies for satisfiability testing
The power of local search for satissability testing can be further enhanced by employing a new strategy, called mixed random walk, for escaping from local minima, which allows us to handle formulas that are substantially larger than those that can be solved with basic local search.
Parallel Resolution of the Satisfiability Problem: A Survey
The intention is to review the work of this last decade on parallel resolution of SAT with DPLL solvers which are the most widely used complete ones.
Algorithms for the satisfiability (SAT) problem: A survey
This survey presents a general framework (an algorithm space) that integrates existing SAT algorithms into a unified perspective and describes sequential and parallel SAT algorithms including variable splitting, resolution, local search, global optimization, mathematical programming, and practical SAT algorithms.
Ant Colony Optimization with Adaptive Fitness Function for Satisfiability Testing
MaxMin-SAT is the first ACO algorithm for SAT that implements an Adaptive Fitness Function, which is a technique used for Genetic Algorithms to escape local optima.
GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem
These experiments show that GASAT provides very competitive results, and its overall performance with state-of-the-art SAT algorithms is compared.
Algorithms for the maximum satisfiability problem
Two recent local search algorithmic schemes are considered, the Simulated Annealing method of Kirkpatrick, Gelatt and Vecchi and the Steepest Ascent Mildest Descent method, and adapt them to the Maximum Satisfiability problem and are shown empirically to be more efficient than the heuristics previously proposed in the literature.
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
Scaling and Probabilistic Smoothing (SAPS), an efficient SAT algorithm that is conceptually closely related to ESG, is developed, and a reactive version of SAPS (RSAPS) is introduced that adaptively tunes one of the algorithm's important parameters.
The complexity of theorem-proving procedures
  • S. Cook
  • Mathematics, Computer Science
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a