國立虎尾科技大學 |

Theory and Applications of Satisfiability Testing -- SAT 2015 = 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Theory and Applications of Satisfiability Testing -- SAT 2015/ edited by Marijn Heule, Sean Weaver.
其他題名:	18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings /
其他作者:	Heule, Marijn.
面頁冊數:	XIX, 436 p. 94 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computers. -
電子資源:	https://doi.org/10.1007/978-3-319-24318-4
ISBN:	9783319243184

Theory and Applications of Satisfiability Testing -- SAT 2015 = 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings /
Theory and Applications of Satisfiability Testing -- SAT 201518th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings /[electronic resource] :edited by Marijn Heule, Sean Weaver. - 1st ed. 2015. - XIX, 436 p. 94 illus. in color.online resource. - Theoretical Computer Science and General Issues ;9340. - Theoretical Computer Science and General Issues ;9163.

This book constitutes the refereed proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015, held in Austin, TX, USA, in September 2015. The 21 regular papers, 2 short papers and 7 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including theoretical advances (exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, and applications, as well as case studies and reports on insightful findings based on rigorous experimentation. The paper 'Constructing SAT Filters with a Quantum Annealer' is published open access under a CC BY-NC 2.5 license at link.springer.com.

ISBN: 9783319243184

Standard No.: 10.1007/978-3-319-24318-4doiSubjects--Topical Terms:

565115
Computers.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Theory and Applications of Satisfiability Testing -- SAT 2015 = 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings /
LDR:02430nam a22004215i 4500 001 969230
003 DE-He213
005 20200705130754.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319243184 $9 978-3-319-24318-4
024 7 $a 10.1007/978-3-319-24318-4 $2 doi
035 $a 978-3-319-24318-4
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Theory and Applications of Satisfiability Testing -- SAT 2015 $h [electronic resource] : $b 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings / $c edited by Marijn Heule, Sean Weaver.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XIX, 436 p. 94 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 9340
520 $a This book constitutes the refereed proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015, held in Austin, TX, USA, in September 2015. The 21 regular papers, 2 short papers and 7 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including theoretical advances (exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, and applications, as well as case studies and reports on insightful findings based on rigorous experimentation. The paper 'Constructing SAT Filters with a Quantum Annealer' is published open access under a CC BY-NC 2.5 license at link.springer.com.
650 0 $a Computers. $3 565115
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer science—Mathematics. $3 1253519
650 1 4 $a Theory of Computation. $3 669322
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Mathematics of Computing. $3 669457
700 1 $a Heule, Marijn. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1069346
700 1 $a Weaver, Sean. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1069347
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319243177
776 0 8 $i Printed edition: $z 9783319243191
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-24318-4
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)