SAT 2005 [electronic resource] : satisfiability research in the year 2005 / edited by Enrico Giunchiglia and Toby Walsh.

Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. The core of many reasoning problems in automated deduction are propositional. This work deals with the progress made in solving propositiona...

Full description

Bibliographic Details

Online Access:	Full Text (via Springer)
Other Authors:	Giunchiglia, Enrico, Walsh, Toby
Other title:	Satisfiability research in the year 2005. Journal of automated reasoning. Vol. 35, no. 1-3.
Format:	Electronic eBook
Language:	English
Published:	Dordrecht : Springer, ©2006.
Subjects:	Computer algorithms. Computational complexity. Propositional calculus.