48,68 €
54,09 €
-10% with code: EXTRA
Introduction to Propositional Satisfiability
Introduction to Propositional Satisfiability
48,68
54,09 €
  • We will send in 10–14 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…
54.09
  • Publisher:
  • Year: 2014
  • Pages: 378
  • ISBN-10: 1848901399
  • ISBN-13: 9781848901391
  • Format: 15.6 x 23.4 x 2 cm, minkšti viršeliai
  • Language: English
  • SAVE -10% with code: EXTRA

Introduction to Propositional Satisfiability (e-book) (used book) | bookbook.eu

Reviews

Description

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.

EXTRA 10 % discount with code: EXTRA

48,68
54,09 €
We will send in 10–14 business days.

The promotion ends in 21d.20:17:10

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 0,54 Book Euros!?
  • Author: Victor Marek
  • Publisher:
  • Year: 2014
  • Pages: 378
  • ISBN-10: 1848901399
  • ISBN-13: 9781848901391
  • Format: 15.6 x 23.4 x 2 cm, minkšti viršeliai
  • Language: English English

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.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)