Extreme cases in SAT problems

DOI10.1007/978-3-319-40970-2_7MaRDI QIDQ2818004zbMATH OpenOpenAlexFDO

Authors Gilles Audemard, Laurent Simon

Publication date 5 September 2016

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

Full work available at URL https://doi.org/10.1007/978-3-319-40970-2_7

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Local Restarts
• A dynamic restart strategy for solving SAT problem
• A bit-encoding phase selection strategy for satisfiability solvers
• scientific article; zbMATH DE number 956858
• BerkMin: A fast and robust SAT-solver

Cites work

• Inprocessing rules
• March\_dl: adding adaptive heuristics and a new branching strategy
• Optimal speedup of Las Vegas algorithms
• SATzilla: portfolio-based algorithm selection for SAT
• SUNNY: a lazy portfolio approach for constraint solving
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing

Cited in

(3)

• SAT problems with chains of dependent variables
• A bit-encoding phase selection strategy for satisfiability solvers
• An adaptive prefix-assignment technique for symmetry reduction

Describes a project that uses

Uses Software

• SUNNY
• Lingeling
• abcdSAT
• CryptoMiniSat
• Glucose
• Chaff
• SATzilla
• MiniSat

This page was built for publication: Extreme cases in SAT problems

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