Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMATH Open1122.68609OpenAlexW2483910514MaRDI QIDQ5714765FDOQ5714765

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)

Cited In (7)

• Solving satisfiability problems with preferences
• Statistical regimes across constrainedness regions
• An efficient approach to solving random \(k\)-SAT problems
• Autonomous operator management for evolutionary algorithms
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• SAT competition 2020

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)