SAT 2005 - Satisfiability Research in the Year 2005 (Hardcover, 2006 ed.)

This book is devoted to recent progress made in solving propositional satisfiability and related problems. 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. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. In 1957, Allen Newell and Herb Simon introduced the Logic Theory Machine to prove propositional theorems from Whitehead and Russel's Principia mathematica. ...] This book follows on from the highly successful volume entitled SAT 2000 published five years ago. The papers in SAT 2005 fall (not entirely neatly) into the following categories: complete methods, local and stochastic search methods, random problems, applications, and extensions beyond the propositional.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Release date:	October 2006
First published:	December 2006
Editors:	Enrico Giunchiglia • Toby Walsh
Dimensions:	235 x 155 x 17mm (L x W x T)
Format:	Hardcover
Pages:	293
Edition:	2006 ed.
ISBN-13:	978-1-4020-4552-3
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Computer programming > Software engineering Books > Computing & IT > Applications of computing > Artificial intelligence > General
LSN:	1-4020-4552-2
Barcode:	9781402045523

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!