Local search strategies for satisfiability testing
نویسندگان
چکیده
منابع مشابه
ILP Through Propositionalization and Stochastic k-Term DNF Learning
ILP has been successfully applied to a variety of tasks. Nevertheless, ILP systems have huge time and storage requirements, owing to a large search space of possible clauses. Therefore, clever search strategies are needed. One promising family of search strategies is that of stochastic local search methods. These methods have been successfully applied to propositional tasks, such as satisfiabil...
متن کاملAnalysis of Random Noise and Random Walk Algorithms
Random Noise and RandomWalk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis of the performance of these algorithms. The performance measures we consider are the probability of finding a satisfying assignment and the distribution of the best solution observed on a given SAT instance. The analysis...
متن کاملVariable-Selection Heuristics in Local Search for SAT
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a greedy local search such as GSAT, the major decision in variable selection is the strategy for breaking ties between variables that offer the same improvement in the number of unsatisfied clauses. In this paper, we anal...
متن کاملLocal Search Strategies for Satis
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain classes of CNF formulas (Sel-man et al. 1992). In this paper we demonstrate that the power of local search for satissability testing can be further enhanced by employing a new strategy, called \mixed random walk", for escaping from local minima. We present a detailed comparison of this ...
متن کاملVariable-Selection Heuristics in Local
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a greedy local search such as GSAT, the major decision in variable selection is the strategy for breaking ties between variables that offer the same improvement in the number of unsatisfied clauses. In this paper, we anal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993