Ultimately incremental SAT

DOI10.1007/978-3-319-09284-3_16MaRDI QIDQ3192067zbMATH OpenOpenAlexFDO

Authors Alexander Nadel, Vadim Ryvchin, Ofer Strichman

Publication date 26 September 2014

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

Full work available at URL https://doi.org/10.1007/978-3-319-09284-3_16

Mathematics Subject Classification ID

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

Recommendations

• Efficient SAT solving under assumptions
• Speeding up assumption-based SAT
• Mining backbone literals in incremental SAT. A new kind of incremental data
• Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
• Solving the incremental satisfiability problem

Cited in

(18)

• scientific article; zbMATH DE number 1903356 (Why is no real title available?)
• Conformant planning as a case study of incremental QBF solving
• Speeding up assumption-based SAT
• The incremental satisfiability problem for a two conjunctive normal form
• Incremental preprocessing methods for use in BMC
• Theory and Applications of Satisfiability Testing
• Satisfiability modulo user propagators
• Preprocessing in incremental SAT
• Assignment stack shrinking
• Incremental inprocessing in SAT solving
• Hints revealed
• Mining backbone literals in incremental SAT. A new kind of incremental data
• Efficient SAT solving under assumptions
• Automated benchmarking of incremental SAT and QBF solvers
• Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
• SAT competition 2020
• SAT modulo intuitionistic implications
• Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API

Describes a project that uses

Uses Software

• SatELite
• SATIRE
• MiniSat

This page was built for publication: Ultimately incremental SAT

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