An algorithm based on Tabu search for satisfiability problem

Journal of Computer Science and Technology

Volumn 17, Issue 3, 2002, Pages 340-346

  Huang, Wenqi ^a   Zhang, Defu ^a   Wang, Houxiang ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Local search; Satisfiability; Tabu search

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PROBLEM SOLVING;

LOCAL SEARCH; SATISFIABILITY PROBLEM; TABU SEARCH;

COMPUTATION THEORY;

EID: 0036566304     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02947312     Document Type: Article

References (14)

1. The analysis of algorithms for the proposition logic satisfiability
2. The search for satisfaction
3. A computing procedure for quantification theory
4. A new method for solving hard satisfiability problems
5. Efficient local search for very large-scale satisfiability problems
6. An empirical analysis of search in GSAT
7. A physic-mathematical method for solving conjunctive normal form satisfiability problem
8. Noise strategies for improving local search
9. Simulated annealing for hard satisfiability problems
10. Tabu search for SAT
11. The quasi-physical personification algorithm for solving SAT problem-solar
12. Evidence for invariants in local search
13. Hard and easy distributions of SAT problems