Precise and complete propagation based local search for satisfiability modulo theories

DOI10.1007/978-3-319-41528-4_11MaRDI QIDQ4633534zbMATH OpenOpenAlexFDO

Authors Aina Niemetz, Mathias Preiner, Armin Biere

Publication date 3 May 2019

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-41528-4_11

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Propagation based local search for bit-precise reasoning
• Satisfiability modulo theories
• A Tutorial on Satisfiability Modulo Theories
• A survey of satisfiability modulo theory
• Computer Aided Verification

Cited in

(6)

• Propagation based local search for bit-precise reasoning
• On solving quantified bit-vector constraints using invertibility conditions
• Local Search For Satisfiability Modulo Integer Arithmetic Theories
• Local Search for SMT on Linear Integer Arithmetic
• On Incremental Pre-processing for SMT
• Local search for solving satisfiability of polynomial formulas

This page was built for publication: Precise and complete propagation based local search for satisfiability modulo theories

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