Speeding-up non-clausal local search for propositional satisfiability with clause learning

Authors:
Zbigniew Stachniak;Anton Belov
Affiliations:
Department of Computer Science and Engineering, York University, Toronto, Canada;Department of Computer Science and Engineering, York University, Toronto, Canada
Venue:
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Year:
2008

Citing 11
Cited 3

On the run-time behaviour of stochastic local search algorithms for SAT

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
An Overview of Backtrack Search Satisfiability Algorithms

Annals of Mathematics and Artificial Intelligence
Local Search Algorithms for SAT: An Empirical Evaluation

Journal of Automated Reasoning
An adaptive noise mechanism for walkSAT

Eighteenth national conference on Artificial intelligence
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
Complete local search for propositional satisfiability

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Generation of hard non-clausal random satisfiability problems

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Hiding satisfying assignments: two are better than one

Journal of Artificial Intelligence Research
Variable dependency in local search: prevention Is better than cure

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Evidence for invariants in local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
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

Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Depth-driven circuit-level stochastic local search for SAT

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
On the violation of circuits in decomposable negation normal form

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we discuss search heuristics for non-clausal stochastic local search procedures for propositional satisfiability. These heuristics are based on a new method for variable selection as well as a novel clause learning technique for dynamic input formula simplification as well as for guiding the search for a model.