Theory and Applications of Satisfiability Testing

DOI10.1007/b95238zbMath1204.68205OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325850

Matthias F. M. Stallmann, Franc Brglez, Xiao Yu 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)

Related Items (2)

A taxonomy of exact methods for partial Max-SAT ⋮ On SAT instance classes and a method for reliable performance experiments with SAT solvers

Uses Software

• UnitWalk
• Walksat
• SATO
• QingTing1
• Chaff

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