Theory and Applications of Satisfiability Testing – SAT 2017 [[electronic resource] :] : 20th International Conference, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings / / ed.: Gaspers, Serge., Walsh, Toby. - 1st ed. 2017. - [S. l. : s. n.]. - XIII, 476 p. 68 illus. - Б. ц. Рубрики: Computers.    Artificial intelligence.    Software engineering.    Operating systems (Computers).    Computer organization.    Numerical analysis.    Theory of Computation.    Artificial Intelligence.    Software Engineering.    Operating Systems.    Computer Systems Organization and Communication Networks.    Numeric Computing. Анотація: This book constitutes the refereed proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, held in Melbourne, Australia, in August/September 2017. The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo theories; and SAT encodings. Перейти: https://doi.org/10.1007/978-3-319-66263-3 Дод.точки доступу: Gaspers, Serge. \ed.\; Walsh, Toby. \ed.\; SpringerLink (Online service) Свободных экз. нет