Theory and Applications of Satisfiability Testing
Subtitle: 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers (Lecture Notes in Computer Science)
Contributors: Holger H. Hoos (Editor); David G. Mitchell (Editor)
Edition: 1 edition
Publisher: Springer
Published: August 22, 2005
Language: eng
Format: Paperback
Number of pages: 393
ISBN-13: 9783540278290
Subjects: Computing and Information Technology; Operating Systems - General; Computers; Mathematics; Computer Books: Operating Systems; Computer Science; Logic; Mathematics / Logic; QBF; SAT algorithms; SAT solvers; complexity theory; heuristics; local search; probabilistic algorithms; proof systems; Algebra, Boolean; Computer algorithms; Congresses; Propositional calculus
First sentence: In the last few years, the AI community has investigated the generic problem solving approach which consists of modeling hard combinatorial problems as instances of the propositional satisfiability problem (SAT) and then solving the resulting encodings with algorithms for SAT.