# An Evolutionary Local Search Method for Incremental Satisfiability

@inproceedings{Menai2004AnEL, title={An Evolutionary Local Search Method for Incremental Satisfiability}, author={Mohamed El Bachir Menai}, booktitle={AISC}, year={2004} }

Incremental satisfiability problem (ISAT) is considered as a generalisation of the Boolean satisfiability problem (SAT). It involves checking whether satisfiability is maintained when new clauses are added to an initial satisfiable set of clauses. Since stochastic local search algorithms have been proved highly efficient for SAT, it is valuable to investigate their application to solve ISAT. Extremal Optimization is a simple heuristic local search method inspired by the dynamics of living…

## 5 Citations

Evolutionary Computation and Constraint Satisfaction

- Computer ScienceHandbook of Computational Intelligence
- 2015

This chapter focuses on the combination of evolutionary computation techniques and constraint satisfaction problems (CSP s) and an important prelude to the work covered here as it advocates itself as an alternative approach to programming.

Dynamic Problems and Nature Inspired

- Business
- 2009

Dynamic problems and nature inspired meta-heuristics. Originally published in Studies in computational intelligence: Biologically-inspired optimisation methods: parallel algorithms, systems and…

Dynamic Problems and Nature Inspired Meta-Heuristics

- Business, Computer Science2006 Second IEEE International Conference on e-Science and Grid Computing (e-Science'06)
- 2006

This survey paper examines representative works and methodologies of the newer meta-heuristics, particularly ant colony optimisation, particle swarm optimisation and extremal optimisation on biological systems.

Research - Areas of interest

- Psychology
- 2010

My research interests include accessibility, assistive technology and human-product interaction that will benefit the health and wellbeing of users with disabilities and age-related impairments. I am…

## References

SHOWING 1-10 OF 24 REFERENCES

Efficient Initial Solution to Extremal Optimization Algorithm for Weighted MAXSAT Problem

- Computer ScienceIEA/AIE
- 2003

An algorithm based on another distribution, known as the Bose-Einstein distribution in quantum physics, which provides a new stochastic initialization scheme to an Extremal Optimization procedure and is proposed for the approximated solution to an instance of the weighted maximum satisfiability problem (MAXSAT).

Stochastic Local Search Methods for Dynamic SAT- an Initial Investigation

- Mathematics
- 2000

We introduce the dynamic SAT problem, a generalisation of the satisfiability problem in propositional logic which allows changes of a problem over time. DynSAT can be seen as a particular form of a…

Noise Strategies for Improving Local Search

- Computer Science, MathematicsAAAI
- 1994

It is shown that mixed random walk is the superior strategy for solving MAX-SAT problems, and results demonstrating the effectiveness of local search with walk for solving circuit synthesis and circuit diagnosis problems are presented.

Solving the incremental satisfiability problem

- Computer ScienceJ. Log. Program.
- 1993

Extremal Optimization for Graph Partitioning

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2001

Numerical results demonstrate that extremal optimization maintains consistent accuracy for increasing system sizes, with an approximation error decreasing over run time roughly as a power law t(-0.4).

Temporal induction by incremental SAT solving

- Computer ScienceElectron. Notes Theor. Comput. Sci.
- 2003

Evidence for Invariants in Local Search

- Computer ScienceAAAI/IAAI
- 1997

This work presents two statistical measures of the local search process that allow one to quickly find the optimal noise settings, and applies these principles to the problem of evaluating new search heuristics, and discovered two promising new strategies.

The complexity of theorem-proving procedures

- Mathematics, Computer ScienceSTOC
- 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…

A Computing Procedure for Quantification Theory

- MathematicsJACM
- 1960

In the present paper, a uniform proof procedure for quantification theory is given which is feasible for use with some rather complicated formulas and which does not ordinarily lead to exponentiation.