Denna webbshop är stängd för köp.
Klicka här för mer information

Bridging Constraint Satisfaction and Boolean Satisfiability
  • Bandtyp: Inbunden
  • Språk: Engelska
  • Utgiven: 20150819
  • Antal sidor: 113
  • Upplaga: 1st ed. 2015, 
    Vikt i gram: 366
  • ISBN10:3319218093
  • ISBN13:9783319218090

Bridging Constraint Satisfaction and Boolean Satisfiability

(Inbunden)
Beskrivning:

This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances.

Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years.

The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science. 

Kundrecensioner och bloggar

Sök fler böcker:

Kunder som köpt denna bok har
även köpt:
Skotten i Köpenhamn :  ett reportage om
Uppgång och fall
Uppgång och fall
av Strömquist, Liv
Den allvarsamma leken
Den allvarsamma leken
av Söderberg, Hjalmar
Miniatyrmakaren
Miniatyrmakaren
av Burton, Jessie
Min mors självbiografi
Min mors självbiografi
av Kincaid, Jamaica