東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Theory and applications of satisfiab...

SAT (Conference) (2017 :)

Linked to FindBook

Google Book

Amazon

博客來

Theory and applications of satisfiability testing - SAT 2017 = 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Theory and applications of satisfiability testing - SAT 2017/ edited by Serge Gaspers, Toby Walsh.
Reminder of title:	20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017 : proceedings /
remainder title:	SAT 2017
other author:	Gaspers, Serge.
corporate name:	SAT (Conference)
Published:	Cham :Springer International Publishing : : 2017.,
Description:	xiii, 476 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Computer algorithms - Congresses. -
Online resource:	http://dx.doi.org/10.1007/978-3-319-66263-3
ISBN:	9783319662633

Theory and applications of satisfiability testing - SAT 2017 = 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017 : proceedings /
Theory and applications of satisfiability testing - SAT 201720th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017 : proceedings /[electronic resource] :SAT 2017edited by Serge Gaspers, Toby Walsh. - Cham :Springer International Publishing :2017. - xiii, 476 p. :ill., digital ;24 cm. - Lecture notes in computer science,104910302-9743 ;. - Lecture notes in computer science ;10491..

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.

ISBN: 9783319662633

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

576357
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Theory and applications of satisfiability testing - SAT 2017 = 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017 : proceedings /
LDR:01818nmm a2200349 a 4500 001 2106158
003 DE-He213
005 20170808125455.0
006 m d
007 cr nn 008maaau
008 180417s2017 gw s 0 eng d
020 $a 9783319662633 $q (electronic bk.)
020 $a 9783319662626 $q (paper)
024 7 $a 10.1007/978-3-319-66263-3 $2 doi
035 $a 978-3-319-66263-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UY $2 bicssc
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b S253 2017
111 2 $a SAT (Conference) $n (20th : $d 2017 : $c Melbourne, Vic.) $3 3251747
245 1 0 $a Theory and applications of satisfiability testing - SAT 2017 $h [electronic resource] : $b 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017 : proceedings / $c edited by Serge Gaspers, Toby Walsh.
246 3 $a SAT 2017
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xiii, 476 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10491
520 $a 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.
650 0 $a Computer algorithms $x Congresses. $3 576357
650 0 $a Computer software $x Verification $v Congresses. $3 844546
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 890894
650 2 4 $a Software Engineering. $3 890874
650 2 4 $a Operating Systems. $3 892491
650 2 4 $a Computer Systems Organization and Communication Networks. $3 891212
650 2 4 $a Numeric Computing. $3 892606
700 1 $a Gaspers, Serge. $3 3251748
700 1 $a Walsh, Toby. $3 783938
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 10491. $3 3251749
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-66263-3
950 $a Computer Science (Springer-11645)