Guided local search for solving SAT and weighted MAX-SAT problems

DOI10.1023/A:1006343127545zbMath0967.68152OpenAlexW1566650019MaRDI QIDQ1977758

Patrick Mills, Edward P. K. Tsang

Publication date: 18 May 2000

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

Full work available at URL: https://doi.org/10.1023/a:1006343127545

zbMATH Keywords

SAT problemguided local search

Mathematics Subject Classification ID

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

Related Items (13)

Learning MAX-SAT from contextual examples for combinatorial optimisation ⋮ Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks ⋮ Go-MOCE: greedy order method of conditional expectations for Max Sat ⋮ Solving the weighted MAX-SAT problem using the dynamic convexized method ⋮ Scatter search and genetic algorithms for MAX-SAT problems ⋮ FITNESS LANDSCAPES AND THE ANDREWS–CURTIS CONJECTURE ⋮ Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? ⋮ Solving weighted MAX-SAT via global equilibrium search ⋮ Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems ⋮ Memory intensive AND/OR search for combinatorial optimization in graphical models ⋮ Using the method of conditional expectations to supply an improved starting point for CCLS ⋮ Template design under demand uncertainty by integer linear local search ⋮ Unnamed Item

This page was built for publication: Guided local search for solving SAT and weighted MAX-SAT problems