Efficient SAT Solving under Assumptions

DOI10.1007/978-3-642-31612-8_19zbMath1273.68358OpenAlexW94133491MaRDI QIDQ2843331

Vadim Ryvchin, Alexander Nadel

Publication date: 12 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31612-8_19

Mathematics Subject Classification ID

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

Related Items (7)

Nonexistence Certificates for Ovals in a Projective Plane of Order Ten ⋮ Combining incomplete search and clause generation: an application to the orienteering problems with time windows ⋮ Managing caching strategies for stream reasoning with reinforcement learning ⋮ Local search with a SAT oracle for combinatorial optimization ⋮ MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures ⋮ A nonexistence certificate for projective planes of order ten with weight 15 codewords ⋮ On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving

This page was built for publication: Efficient SAT Solving under Assumptions