Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMATH Open1122.68609OpenAlexW2483910514MaRDI QIDQ5714765FDOQ5714765

Authors Daniel Le Berre, Laurent Simon

Publication date 16 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11527695

Mathematics Subject Classification ID

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

Recommendations

• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 5139164
• scientific article; zbMATH DE number 5139172
• SAT competition 2020
• SAT race 2015

Cited in

(12)

• Statistical regimes across constrainedness regions
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• Solving satisfiability problems with preferences
• Careful ranking of multiple solvers with timeouts and ties
• The 2013 evaluation of SMT-COMP and SMT-LIB
• An efficient approach to solving random \(k\)-SAT problems
• SAT competition 2020
• Autonomous operator management for evolutionary algorithms
• Promoting robust black-box solvers through competitions
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• Theory and Applications of Satisfiability Testing
• The first and second Max-SAT evaluations

Describes a project that uses

Uses Software

• UnitWalk
• SatEx
• UBCSAT
• SATO
• zChaff
• Chaff
• QBFLIB
• Velev SAT Benchmarks

This page was built for publication: Theory and Applications of Satisfiability Testing

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