Hints revealed

DOI10.1007/978-3-319-24318-4_7MaRDI QIDQ3453213zbMATH OpenOpenAlexFDO

Authors Jonathan Kalechstain, Vadim Ryvchin, Nachum Dershowitz

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_7

Mathematics Subject Classification ID

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

Recommendations

• Using hints to increase the effectiveness of an automated reasoning program: Case studies
• Theory and Applications of Satisfiability Testing
• Ultimately incremental SAT
• scientific article; zbMATH DE number 956858
• Concurrent clause strengthening

Cites work

• Accelerating bounded model checking of safety properties
• Faster Extraction of High-Level Minimal Unsatisfiable Cores
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• scientific article; zbMATH DE number 2243370 (Why is no real title available?)
• Temporal induction by incremental SAT solving
• Theory and Applications of Satisfiability Testing
• Theory and applications of satisfiability testing -- SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19--22, 2011. Proceedings

Cited in

(2)

• Learning from hints
• A milestone reached and a secret revealed

Describes a project that uses

Uses Software

• MiniSat
• Chaff
• AMUSE

This page was built for publication: Hints revealed

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