Hints Revealed

DOI10.1007/978-3-319-24318-4_7zbMath1471.68249OpenAlexW4254803482MaRDI QIDQ3453213

Vadim Ryvchin, Nachum Dershowitz, Jonathan Kalechstain

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)

Uses Software

• MiniSat
• Chaff
• AMUSE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory and applications of satisfiability testing -- SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19--22, 2011. Proceedings
• Accelerating bounded model checking of safety properties
• Faster Extraction of High-Level Minimal Unsatisfiable Cores
• Theory and Applications of Satisfiability Testing

This page was built for publication: Hints Revealed