Bridging Constraint Satisfaction and Boolean Satisfiability [electronic resource]

 0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Justyna Petke

Ngôn ngữ:

ISBN-13: 978-3319218106

Ký hiệu phân loại: 006.3 Artificial intelligence

Thông tin xuất bản: Cham : Springer International Publishing : Imprint: Springer, 2015.

Mô tả vật lý: XI, 113 p. 19 illus. , online resource.

Bộ sưu tập: Tài liệu truy cập mở

ID: 326922

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.  .
Tạo bộ sưu tập với mã QR

THƯ VIỆN - TRƯỜNG ĐẠI HỌC CÔNG NGHỆ TP.HCM

ĐT: (028) 71010608 | Email: tt.thuvien@hutech.edu.vn

Copyright @2024 THƯ VIỆN HUTECH