Learning variable activity initialisation for lazy clause generation solvers

DOI10.1007/978-3-030-78230-6_4MaRDI QIDQ2117201zbMATH OpenOpenAlexFDO

Authors Ronald van Driel, Emir Demirović, Neil Yorke-Smith

Publication date 21 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-78230-6_4

Mathematics Subject Classification ID

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

Cites work

• An investigation into prediction + optimisation for the knapsack problem
• Core-boosted linear search for incomplete MaxSAT
• CrystalBall: gazing in the black box of SAT solving
• Debugging unsatisfiable constraint models
• Guiding high-performance SAT solvers with unsat-core predictions
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Model agnostic solution of CSPs via deep learning: a preliminary study
• Propagation via lazy clause generation

Cited in

(2)

• Learning and fine-tuning a generic value-selection heuristic inside a constraint programming solver
• \textsf{lazyCoP}: lazy paramodulation meets neurally guided search

Describes a project that uses

Uses Software

• CrystalBall
• NeuroSAT
• GitHub
• sunny-cp
• CHUFFED
• Chaff

This page was built for publication: Learning variable activity initialisation for lazy clause generation solvers

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