Clause weighting local search for SAT

DOI10.1007/S10817-005-9010-1MaRDI QIDQ862404zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• AI 2005: Advances in Artificial Intelligence
• AI 2003: Advances in Artificial Intelligence
• Neighbourhood Clause Weight Redistribution in Local Search for SAT
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 1954173

Cites work

• A discrete Lagrangian-based global-search method for solving satisfiability problems
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• scientific article; zbMATH DE number 1954173 (Why is no real title available?)
• Local search characteristics of incomplete SAT procedures
• Stochastic local search. Foundations and applications.
• Theory and Applications of Satisfiability Testing

Cited in

(12)

• Relaxation heuristics for the set multicover problem with generalized upper bound constraints
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient
• Entropic herding
• Neighbourhood Clause Weight Redistribution in Local Search for SAT
• A switching criterion for intensification and diversification in local search for SAT
• scientific article; zbMATH DE number 1954173 (Why is no real title available?)
• AI 2003: Advances in Artificial Intelligence
• Theory and Applications of Satisfiability Testing
• AI 2005: Advances in Artificial Intelligence
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• Local-MIP: efficient local search for mixed integer programming

Describes a project that uses

Uses Software

• Chaff

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862404)