#### DMCA

## Inc*: An Incremental Approach for Improving Local Search Heuristics

### Citations

3732 |
Genetic Programming: On the Programming of Computers by Means of Natural Selection
- Koza
- 1992
(Show Context)
Citation Context ...uce an approach that presents some similarity with incremental SAT, but where the objective is to solve SAT problems, not incremental SAT problems. In particular, we will use Genetic Programming (GP) =-=[13, 14]-=- to investigate the benefits of dynamically changing the number of active clauses during the course of solving SAT problems. So, the solver is given a CNF formula including all the clauses from the be... |

1050 | The complexity of theorem-proving procedures
- Cook
- 1971
(Show Context)
Citation Context ...ork is given in Section 4, Finally, we draw some conclusions in Section 5. 2 SAT problem SAT is a classical combinatorial optimisation problem. It was the first problem to be proved to be NP-Complete =-=[3]-=-. Many heuristics have been proposed and successfully used for solving the SAT problem (e.g., [8, 18, 20, 19]). SAT has many different practical applications. Also, many other problems can be transfor... |

730 | A new method for solving hard satisfiability problems,
- Selman, Levesque, et al.
- 1992
(Show Context)
Citation Context ... classical combinatorial optimisation problem. It was the first problem to be proved to be NP-Complete [3]. Many heuristics have been proposed and successfully used for solving the SAT problem (e.g., =-=[8, 18, 20, 19]-=-). SAT has many different practical applications. Also, many other problems can be transformed into SAT problems.2 Mohamed Bader-El-Den and Riccardo Poli The target in SAT is to determine whether it ... |

693 |
A machine program for theoremproving..
- Davis, Logemann, et al.
- 1962
(Show Context)
Citation Context ... the same recursive check is done using the opposite truth value for the variable originally selected. The best complete SAT solvers are instantiations of the Davis Putnam Logemann Loveland procedure =-=[4]-=-. Incomplete algorithms are often based on local search heuristics (Section 2.1). These algorithms can be extremely fast, but success cannot be guaranteed. On the contrary, complete algorithms guarant... |

457 | Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems’.
- Minton, Johnston, et al.
- 1992
(Show Context)
Citation Context ... is also important to know if the instance could be still satisfied if further (arbitrary) Boolean clauses were added to the current set. This is known in the literature as incremental or dynamic SAT =-=[16]-=-. In incremental SAT the solver normally starts with a certain number of clauses and determines whether this set can be satisfied or not. In case it is satisfied, the solver gives the user the opportu... |

400 | Noise strategies for improving local search.
- Selman, Kautz, et al.
- 1994
(Show Context)
Citation Context ... classical combinatorial optimisation problem. It was the first problem to be proved to be NP-Complete [3]. Many heuristics have been proposed and successfully used for solving the SAT problem (e.g., =-=[8, 18, 20, 19]-=-). SAT has many different practical applications. Also, many other problems can be transformed into SAT problems.2 Mohamed Bader-El-Den and Riccardo Poli The target in SAT is to determine whether it ... |

271 | Foundations of Genetic Programming.
- Poli, Langdon
- 2002
(Show Context)
Citation Context ...uce an approach that presents some similarity with incremental SAT, but where the objective is to solve SAT problems, not incremental SAT problems. In particular, we will use Genetic Programming (GP) =-=[13, 14]-=- to investigate the benefits of dynamically changing the number of active clauses during the course of solving SAT problems. So, the solver is given a CNF formula including all the clauses from the be... |

227 | Domain-independent extensions to gsat: Solving large structured satisfiability problems. In:
- Selman, Kautz
- 1993
(Show Context)
Citation Context ... classical combinatorial optimisation problem. It was the first problem to be proved to be NP-Complete [3]. Many heuristics have been proposed and successfully used for solving the SAT problem (e.g., =-=[8, 18, 20, 19]-=-). SAT has many different practical applications. Also, many other problems can be transformed into SAT problems.2 Mohamed Bader-El-Den and Riccardo Poli The target in SAT is to determine whether it ... |

135 | Towards an Understanding of Hill-Climbing Procedures for SAT,
- Gent, Walsh
- 1993
(Show Context)
Citation Context |

33 | Automated discovery of composite SAT variable-selection heuristics.
- Fukunaga
- 2002
(Show Context)
Citation Context ...osed ASAP, a variant of FlipGA [17]. A good overview of other algorithms of this type is provided in [9]. GP has evolved competitive SAT solvers. For example, Fukunaga evolved local search heuristics =-=[6, 7]-=-. Also, GP has been used to enhance the performance of exact algorithms for SAT by helping the algorithm decide which variables to start the backtracking process with or to evolve heuristics for initi... |

27 | An adaptive evolutionary algorithm for the satisfiability problem.
- Rossi, Marchiori, et al.
- 2000
(Show Context)
Citation Context ...However, offspring were then improved by means of local search methods. The same authors later proposed ASAP, a variant of FlipGA [17]. A good overview of other algorithms of this type is provided in =-=[9]-=-. GP has evolved competitive SAT solvers. For example, Fukunaga evolved local search heuristics [6, 7]. Also, GP has been used to enhance the performance of exact algorithms for SAT by helping the alg... |

19 | Evolving local search heuristics for SAT using genetic programming
- Fukunaga
- 2004
(Show Context)
Citation Context ...osed ASAP, a variant of FlipGA [17]. A good overview of other algorithms of this type is provided in [9]. GP has evolved competitive SAT solvers. For example, Fukunaga evolved local search heuristics =-=[6, 7]-=-. Also, GP has been used to enhance the performance of exact algorithms for SAT by helping the algorithm decide which variables to start the backtracking process with or to evolve heuristics for initi... |

18 |
Generating SAT local-search heuristics using a GP hyper-heuristic framework
- Poli
- 2008
(Show Context)
Citation Context ...ing process with or to evolve heuristics for initialising dynamic decisions [12]. Furthermore, a general framework for evolving local-search 3-SAT heuristics, called GP-HH, has recently been proposed =-=[1, 2]-=-. The aim there is to obtain “disposable” heuristics which are evolved and used for a specific subset of instances of a problem. Results were promising with GP-HH evolving very competitive heuristics.... |

13 | C.: A Flipping Genetic Algorithm for Hard 3-SAT Problems
- Marchiori, Rossi
- 1999
(Show Context)
Citation Context ...do Poli 2.3 Evolutionary algorithms and SAT problem There have been a number of proposals of using evolutionary algorithms for SAT. An example is FlipGA which was introduced by Marchiori and Rossi in =-=[15]-=-, a genetic algorithm was used to generate offspring solutions to SAT using standard genetic operators. However, offspring were then improved by means of local search methods. The same authors later p... |

11 |
A gp-based hyper-heuristic framework for evolving 3-sat heuristics
- Poli
- 2007
(Show Context)
Citation Context ...ing process with or to evolve heuristics for initialising dynamic decisions [12]. Furthermore, a general framework for evolving local-search 3-SAT heuristics, called GP-HH, has recently been proposed =-=[1, 2]-=-. The aim there is to obtain “disposable” heuristics which are evolved and used for a specific subset of instances of a problem. Results were promising with GP-HH evolving very competitive heuristics.... |

11 | Stochastic Local Search Methods for Dynamic SAT - an Initial Investigation
- Hoos, O’Neil
- 2000
(Show Context)
Citation Context ... repair it. Most incremental SAT solvers are based on exact algorithms as in [10], although some researchers have also used incomplete or heuristic-based solvers to deal with incremental SAT problems =-=[11]-=-. The main problem with the latter is that heuristics give no grantee that a solution can be found. Their main advantage is speed. In this paper we will introduce an approach that presents some simila... |

10 | Alembic: An efficient algorithm for CNF preprocessing. In
- Han, Somenzi
- 2007
(Show Context)
Citation Context ...adding more clauses to the existing set. The solver then checks whether the solution is still valid. If not, it attempts to repair it. Most incremental SAT solvers are based on exact algorithms as in =-=[10]-=-, although some researchers have also used incomplete or heuristic-based solvers to deal with incremental SAT problems [11]. The main problem with the latter is that heuristics give no grantee that a ... |

5 |
Y.: Optimizing the initialization of dynamic decision heuristics in DPLL SAT solvers using genetic programming
- Kibria, Li
- 2006
(Show Context)
Citation Context ...o enhance the performance of exact algorithms for SAT by helping the algorithm decide which variables to start the backtracking process with or to evolve heuristics for initialising dynamic decisions =-=[12]-=-. Furthermore, a general framework for evolving local-search 3-SAT heuristics, called GP-HH, has recently been proposed [1, 2]. The aim there is to obtain “disposable” heuristics which are evolved and... |

4 |
L.: Eliminating redundant clauses in SAT instances
- Fourdrinoy, Grégoire, et al.
- 2007
(Show Context)
Citation Context ... instances there are (sometimes numerous) redundant clauses. A redundant clause is a clause that has no effect on the SAT formula [21]. There are algorithms for finding and removing redundant clauses =-=[5]-=-, but the process is complex and very time consuming, especially in large SAT instances. 2 Recently, some researchers have attempted to detect possible hidden structural information inside real-world ... |

1 |
The role of redundant clauses in solving satisfiability problems
- Zeng, McIlraith
- 2005
(Show Context)
Citation Context ... not entirely surprising, since it is well-known that in most hard SAT instances there are (sometimes numerous) redundant clauses. A redundant clause is a clause that has no effect on the SAT formula =-=[21]-=-. There are algorithms for finding and removing redundant clauses [5], but the process is complex and very time consuming, especially in large SAT instances. 2 Recently, some researchers have attempte... |