Many hard examples for resolution
Journal of the ACM (JACM)
Probabilistic approach to the satisfiability problem
Theoretical Computer Science
Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Local search for statistical counting
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Local search characteristics of incomplete SAT procedures
Artificial Intelligence
Boosting complete techniques thanks to local search methods
Annals of Mathematics and Artificial Intelligence
Dynamic Flexible Constraint Satisfaction
Applied Intelligence
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
About the incremental validation of first-order stratified knowledge-based decision-support systems
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Intelligent information systems and applications
An algorithm based on tabu search for satisfiability problem
Journal of Computer Science and Technology
On the Accuracy and Running Time of GSAT
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Towards Local Search for Answer Sets
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Towards Fewer Parameters for SAT Clause Weighting Algorithms
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains
IDEAL '02 Proceedings of the Third International Conference on Intelligent Data Engineering and Automated Learning
Handling Inconsistency Efficiently in the Incremental Construction of Statified Belief Bases
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Overcoming the Christmas Tree Syndrome
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
Efficient initial solution to extremal optimization algorithm for weighted MAXSAT problem
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
An effective heuristic algorithm for the maximum satisfiability problem
Applied Intelligence
GASAT: a genetic local search algorithm for the satisfiability problem
Evolutionary Computation
Boolean satisfiability from theoretical hardness to practical success
Communications of the ACM - A Blind Person's Interaction with Technology
MAX-2-SAT: how good is Tabu search in the worst-case?
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Three truth values for the SAT and Max-SAT problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Phase Transition in the Bandwidth Minimization Problem
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Improving GASAT by replacing tabu search by DLM and enhancing the best members
Artificial Intelligence Review
Average-case analysis for the MAX-2SAT problem
Theoretical Computer Science
Evolutionary computing for the satisfiability problem
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
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
From horn strong backdoor sets to ordered strong backdoor sets
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Artificial Intelligence
ABSO: advanced bee swarm optimization metaheuristic and application to weighted MAX-SAT problem
BI'11 Proceedings of the 2011 international conference on Brain informatics
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
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Random walk with continuously smoothed variable weights
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Efficient and experimental meta-heuristics for MAX-SAT problems
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
An evolutionary local search algorithm for the satisfiability problem
TAINN'05 Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks
Adaptive memory-based local search for MAX-SAT
Applied Soft Computing
Memory-based local search for simplified protein structure prediction
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Gases Brownian Motion Optimization: an Algorithm for Optimization (GBMO)
Applied Soft Computing
Local search for Boolean Satisfiability with configuration checking and subscore
Artificial Intelligence
| Hi-index | 0.00 |
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algonthm for SAT, is introduced and compared With Selman et al. Random Walk Strategy GSAT procedure, in short RWS-GSAT. TSAT does not involve the additional stochastic process of RWS-GSAT. This should facilitate the understanding of why simple local search methods for SAT work. It is shown that the length of the tabu list plays a critical role in the performance of the algorithm. Moreover surprising properties about the (experimental) optimal length of the tabu list are exhibited, raising interesting issues about the nature of hard random SAT problems.