Bridging Constraint Satisfaction and Boolean Satisfiability

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 theoretica...

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile nagusia: Petke, Justyna. (Egilea, http://id.loc.gov/vocabulary/relators/aut)
Erakunde egilea: SpringerLink (Online service)
Formatua: Baliabide elektronikoa eBook
Hizkuntza:English
Argitaratua: Cham : Springer International Publishing : Imprint: Springer, 2015.
Edizioa:1st ed. 2015.
Saila:Artificial Intelligence: Foundations, Theory, and Algorithms,
Gaiak:
Sarrera elektronikoa:https://doi.org/10.1007/978-3-319-21810-6
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!

Antzeko izenburuak