Επικοινωνία
Πώς να κάνετε αγορές;
Παράδοση
Οδηγός αγορών
Bridging Constraint Satisfaction and Boolean Satisfiability
Αγγλική
161 b
30 ημέρες για την επιστροφή των προϊόντων
Μπορεί να σας ενδιαφέρει
/
Χαρτόδετη βιβλιοδεσία
17.65
€
/
Σκληρόδετη βιβλιοδεσία
117.64
€
This book investigates the connections between constraint satisfaction problems (CSP) and Boolean satisfiability problems (SAT) and explains when we should choose a SAT-solver over a constraint solver, and vice versa. The author shows that with some encodings SAT-solvers simulate the effects of enforcing a form of local consistency in expected polynomial-time, which in turn explains why SAT-solvers are able to solve CSP instances of bounded-width structure efficiently, in contrast to conventional constraint solvers.§§The author first presents background notes on CSP and SAT, solver performance and SAT encodings, including a theoretical argument for the choice of the order encoding over the standard ones for several important classes of CSP instances. She provides a complete list of the constraint languages that are encoded to tractable language classes for SAT using the order encoding, and offers both theoretical and empirical comparison of the various SAT encodings of the famous pigeonhole problem.§§The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.§
Πληροφορίες για το βιβλίο
Αγγλική
