Additive versus multiplicative clause weighting for SAT

摘要: This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one most recently developed algorithms (SAPS), an experimental study was constructed to isolate effects in comparison weighting, while controlling other key features two approaches, namely use random versus flat moves, deterministic probabilistic weight smoothing multiple single inclusion literals local search neighborhood. As a result this investigation we pure scheme (PAWS) which can outperform on range difficult problems, whtle requiring considerably less effort terms parameter turning. We conclude that shows better scaling properties because it makes distinction between costs so considers larger domain possible moves.