Order Total (1 Item Items):
Shipping Destination:
Bridging Constraint Satisfaction Boolean by Petke Justyna (26 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (26)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (11)
- Not Print on Demand (18)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
Seller Location
Seller Rating
-
US$ 59.32
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New. SUPER FAST SHIPPING.
-
US$ 59.16
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 59.54
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New.
-
Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 68.43
Convert currencyUS$ 16.07 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
US$ 66.26
Convert currencyUS$ 20.78 shipping from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPaperback. Condition: New.
-
Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 70.22
Convert currencyUS$ 16.07 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Bridging Constraint Satisfaction and Boolean Satisfiability
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 70.20
Convert currencyUS$ 20.12 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New. pp. 128.
-
Condition: New. pp. 130.
-
Bridging Constraint Satisfaction and Boolean Satisfiability
Published by Springer International Publishing, 2015
ISBN 10: 3319218093 ISBN 13: 9783319218090
Language: English
US$ 64.07
Convert currencyUS$ 34.68 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketBuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
Bridging Constraint Satisfaction and Boolean Satisfiability
Published by Springer, Berlin, Springer International Publishing, Springer, 2016
ISBN 10: 3319373641 ISBN 13: 9783319373645
Language: English
US$ 68.26
Convert currencyUS$ 33.77 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketTaschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
US$ 90.29
Convert currencyUS$ 13.42 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketHardcover. Condition: Brand New. 130 pages. 9.50x6.50x0.75 inches. In Stock.
-
Bridging Constraint Satisfaction and Boolean Satisfiability
Published by Springer International Publishing, Springer International Publishing Aug 2015, 2015
ISBN 10: 3319218093 ISBN 13: 9783319218090
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
US$ 64.07
Convert currencyUS$ 63.97 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketBuch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 128 pp. Englisch.
-
Bridging Constraint Satisfaction and Boolean Satisfiability
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 125.73
Convert currencyUS$ 20.12 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
US$ 114.69
Convert currencyUS$ 33.54 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
-
US$ 145.58
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Bridging Constraint Satisfaction and Boolean Satisfiability
Published by Springer International Publishing Aug 2015, 2015
ISBN 10: 3319218093 ISBN 13: 9783319218090
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
US$ 64.07
Convert currencyUS$ 26.75 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketBuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 128 pp. Englisch.
-
Bridging Constraint Satisfaction and Boolean Satisfiability
Published by Berlin Springer International Publishing Springer Okt 2016, 2016
ISBN 10: 3319373641 ISBN 13: 9783319373645
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
US$ 64.07
Convert currencyUS$ 26.75 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketTaschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 113 pp. Englisch.
-
US$ 91.21
Convert currencyUS$ 8.72 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 128.
-
US$ 93.93
Convert currencyUS$ 8.72 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 130.
-
US$ 99.69
Convert currencyUS$ 11.57 shipping from Germany to U.S.A.Quantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. 128.
-
US$ 101.54
Convert currencyUS$ 11.57 shipping from Germany to U.S.A.Quantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. 130.
-
Bridging Constraint Satisfaction and Boolean Satisfiability
Published by Springer International Publishing, 2015
ISBN 10: 3319218093 ISBN 13: 9783319218090
Language: English
US$ 57.94
Convert currencyUS$ 56.98 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Explains why SAT-solvers are efficient on certain classes of CSPsExplains which SAT encodings preserve tractability of certain classes of CSPsValuable for researchers and graduate students in artificial intelligence and theoretical comp.
-
Bridging Constraint Satisfaction and Boolean Satisfiability
Published by Springer International Publishing, 2016
ISBN 10: 3319373641 ISBN 13: 9783319373645
Language: English
US$ 58.38
Convert currencyUS$ 56.98 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Explains why SAT-solvers are efficient on certain classes of CSPsExplains which SAT encodings preserve tractability of certain classes of CSPsValuable for researchers and graduate students in artificial intelligence and theoretical comp.
