Mining Backbone Literals in Incremental SAT

DOI10.1007/978-3-319-24318-4_8zbMath1471.68247OpenAlexW2226559086MaRDI QIDQ3453214

Vadim Ryvchin, Alexander Ivrii, Ofer Strichman

Publication date: 20 November 2015

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-24318-4_8

Mathematics Subject Classification ID

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

Uses Software

• MiniSat
• SATIRE
• MUSer2

Cites Work

• Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
• Faster Extraction of High-Level Minimal Unsatisfiable Cores
• SAT-Based Model Checking without Unrolling
• Short proofs are narrow—resolution made simple
• Algorithms for computing backbones of propositional formulae
• Theory and Applications of Satisfiability Testing
• A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
• Computer Aided Verification
• Unnamed Item
• Unnamed Item

This page was built for publication: Mining Backbone Literals in Incremental SAT