Clause weighting local search for SAT

DOI10.1007/S10817-005-9010-1zbMath1109.68106OpenAlexW2027789671MaRDI QIDQ862404

N. E. Zubov

Publication date: 24 January 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10072/13781

zbMATH Keywords

multiplicative algorithmpropositional satisfiability testingpure additive weighting scheme

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Relaxation heuristics for the set multicover problem with generalized upper bound constraints ⋮ Entropic herding ⋮ Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs ⋮ Local search with edge weighting and configuration checking heuristics for minimum vertex cover ⋮ Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient

Uses Software

• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• A discrete Lagrangian-based global-search method for solving satisfiability problems
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Theory and Applications of Satisfiability Testing
• Local search characteristics of incomplete SAT procedures

This page was built for publication: Clause weighting local search for SAT