Evolving difficult SAT instances thanks to local search
نویسنده
چکیده
We propose to use local search algorithms to produce sat instances which are harder to solve than randomly generated k-cnf formulae. The first results, obtained with rudimentary search algorithms, show that the approach deserves further study. It could be used as a test of robustness for sat solvers, and could help to investigate how branching heuristics, learning strategies, and other aspects of solvers impact there robustness.
منابع مشابه
Generating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific subset of instances of a problem. We test the heuristics evolved by GP-HH against well-known local-search heuristics on a variety of benchmark SAT problems. Results are very encouraging.
متن کاملBoosting Local Search Thanks to cdcl
In this paper, a novel hybrid and complete approach for propositional satisfiability, called SATHYS (Sat Hybrid Solver), is introduced. It efficiently combines the strength of both local search and CDCL based SAT solvers. Considering the consistent partial assignment under construction by the CDCL SAT solver, local search is used to extend it to a model of the Boolean formula, while the CDCL co...
متن کاملComprehensive Score: Towards Efficient Local Search for SAT with Long Clauses
It is widely acknowledged that stochastic local search (SLS) algorithms can efficiently find models of satisfiable formulae for the Boolean Satisfiability (SAT) problem. There has been much interest in studying SLS algorithms on random k-SAT instances. Compared to random 3-SAT instances which have special statistical properties rendering them easy to solve, random k-SAT instances with long clau...
متن کاملBackbone Guided Local Search for Maximum Satisfiability
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of the best local search algorithms designed for SAT, on Max-SAT. We show that Walksat is also effective on Max-SAT, while its effectiveness degrades as the problem is more constrained. We then develop a novel method that e...
متن کاملScoring Functions Based on Second Level Score for k-SAT with Long Clauses
It is widely acknowledged that stochastic local search (SLS) algorithms can efficiently find models for satisfiable instances of the satisfiability (SAT) problem, especially for random k-SAT instances. However, compared to random 3-SAT instances where SLS algorithms have shown great success, random k-SAT instances with long clauses remain very difficult. Recently, the notion of second level sco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1011.5866 شماره
صفحات -
تاریخ انتشار 2010