Variable ordering for efficient SAT search by analyzing constraint-variable dependencies

DOI10.1007/11499107_33MaRDI QIDQ5713735zbMATH OpenOpenAlexFDO

Authors Vijay Durairaj, Priyank Kalla

Publication date 15 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b137280

Mathematics Subject Classification ID

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

Recommendations

• Experimental studies of variable selection strategies based on constraint weights
• Evaluating and improving modern variable and revision ordering strategies in CSPs
• Exploiting multivalued knowledge in variable selection heuristics for SAT solvers
• Using SAT encodings to derive CSP value ordering heuristics
• Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP

Cited in

(1)

• Neighborhood-based variable ordering heuristics for the constraint satisfaction problem

Describes a project that uses

Uses Software

• Walksat
• BerkMin
• MiniSat

This page was built for publication: Variable ordering for efficient SAT search by analyzing constraint-variable dependencies

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