Ultimately Incremental SAT

DOI10.1007/978-3-319-09284-3_16zbMath1423.68464OpenAlexW204013869MaRDI QIDQ3192067

Ofer Strichman, Vadim Ryvchin, Alexander Nadel

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)

Related Items (4)

Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API ⋮ Conformant planning as a case study of incremental QBF solving ⋮ The incremental satisfiability problem for a two conjunctive normal form ⋮ SAT competition 2020

Uses Software

• MiniSat
• SATIRE
• SatELite

This page was built for publication: Ultimately Incremental SAT