Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68205OpenAlexW2494235144MaRDI QIDQ5325850FDOQ5325850

XiaoYu Li, Matthias F. M. Stallmann, Franc Brglez

Publication date: 24 July 2009

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

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

Recommendations

• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
• A switching criterion for intensification and diversification in local search for SAT
• Local search algorithms for SAT: an empirical evaluation
• scientific article; zbMATH DE number 956863
• scientific article; zbMATH DE number 2084740

Mathematics Subject Classification ID

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

Cited In (4)

• A taxonomy of exact methods for partial Max-SAT
• Title not available (Why is that?)
• On SAT instance classes and a method for reliable performance experiments with SAT solvers
• A switching criterion for intensification and diversification in local search for SAT

Uses Software

• UnitWalk
• Walksat
• SATO
• QingTing1
• Chaff

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 Q5325850)