Bridging Constraint Satisfaction and Boolean Satisfiability
商品資訊
商品簡介
This book represents a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by providing theoretical explanations for why SAT-solvers are efficient on certain classes of CSPs and under which SAT encodings tractability of the original CSP instance is preserved.
These fields emerged independently, and they developed different standard problem-solving solutions. In the meantime it is understood that any propositional formula can actually be viewed as an instance of the general constraint satisfaction problem, but the implications of this connection have only been studied in the last few years.
This book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.
作者簡介
Justyna Petke received her D.Phil. from the University of Oxford. She is a Research Associate at the Centre for Research on Evolution, Search and Testing (CREST) in the Dept. of Computer Science, University College London. Her research interests include the connections between constraint satisfaction and search-based software engineering, including genetic improvement and combinatorial interaction testing.
您曾經瀏覽過的商品
購物須知
外文書商品之書封，為出版社提供之樣本。實際出貨商品，以出版社所提供之現有版本為主。部份書籍，因出版社供應狀況特殊，匯率將依實際狀況做調整。
無庫存之商品，在您完成訂單程序之後，將以空運的方式為你下單調貨。為了縮短等待的時間，建議您將外文書與其他商品分開下單，以獲得最快的取貨速度，平均調貨時間為1~2個月。
為了保護您的權益，「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨，請在商品鑑賞期內寄回，且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。