Extreme Cases in SAT Problems

DOI10.1007/978-3-319-40970-2_7zbMath1475.68333OpenAlexW2496887343MaRDI QIDQ2818004

Laurent Simon, Gilles Audemard

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)

Related Items (1)

An adaptive prefix-assignment technique for symmetry reduction

Uses Software

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

Cites Work

• Optimal speedup of Las Vegas algorithms
• Inprocessing Rules
• SUNNY: a Lazy Portfolio Approach for Constraint Solving
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Unnamed Item
• Unnamed Item

This page was built for publication: Extreme Cases in SAT Problems