Preprocessing in incremental SAT

DOI10.1007/978-3-642-31612-8_20MaRDI QIDQ2843332zbMATH OpenOpenAlexFDO

Authors Alexander Nadel, Vadim Ryvchin, Ofer Strichman

Publication date 12 August 2013

Published in Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31612-8_20

Mathematics Subject Classification ID

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

Recommendations

• Incremental preprocessing methods for use in BMC
• Theory and Applications of Satisfiability Testing
• Ultimately incremental SAT
• Incremental inprocessing in SAT solving
• SAT-based preprocessing for MaxSAT

Cited in

(5)

• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Incremental preprocessing methods for use in BMC
• Satisfiability modulo user propagators
• Incremental inprocessing in SAT solving

Describes a project that uses

Uses Software

• SATIRE
• MiniSat

This page was built for publication: Preprocessing in incremental SAT

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