Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT

DOI10.1007/978-3-642-24364-6_12zbMath1348.68227OpenAlexW1601158010MaRDI QIDQ3172891

Roberto Sebastiani, Quoc-Sang Phan, Alberto Griggio, Silvia Tomasi

Publication date: 7 October 2011

Published in: Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL: http://qmro.qmul.ac.uk/xmlui/handle/123456789/6099

Mathematics Subject Classification ID

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

Related Items (3)

Propagation based local search for bit-precise reasoning ⋮ Local Search For Satisfiability Modulo Integer Arithmetic Theories ⋮ Structured learning modulo theories

Uses Software

• UBCSAT
• MathSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Local search algorithms for SAT: an empirical evaluation
• Boosting Local Search Thanks to cdcl
• Theory and Applications of Satisfiability Testing
• Mechanizing Mathematical Reasoning
• Fast and Flexible Difference Constraint Propagation for DPLL(T)

This page was built for publication: Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT