Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325850zbMATH OpenOpenAlexFDO

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

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

Mathematics Subject Classification ID

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

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

Cited in

(4)

• A taxonomy of exact methods for partial Max-SAT
• scientific article; zbMATH DE number 2084740 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• Chaff
• QingTing1
• SATO
• Walksat
• UnitWalk

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)