Introduction to Propositional Satisfiability

By: Victor Marek

Write A Review

Paperback | 24 February 2014

At a Glance

Paperback
378 Pages

Dimensions(cm)
23.6 x 15.6 x 2.0

Paperback

$33.00

or 4 interest-free payments of $8.25 with

or

Ships in 5 to 7 business days

Propositional logic allows for description and then solving of a significant class of constraint satisfaction problems, namely those that require that the domains of variables are finite.

As such, propositional logic finds applications in describing problems stemming from computer science, computer engineering and combinatorial optimization. But logic goes beyond just providing descriptive means - it is supported by mechanisms for computation of answers.

At present there is a class of software systems, SAT solvers, that allow (given enough of resources) for solving problems expressed in propositional logic.

This book studies syntax, semantics, and algorithms for finding solutions of problems expressible in propositional logic. It is addressed to individuals who want to understand the principles on which SAT solvers are based and gain a deeper understanding of techniques used in logic-based solving.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.