國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Theory and applications of satisfiab...

(1998 :)

Theory and applications of satisfiability testing - SAT 202023rd International Conference, Alghero, Italy, July 3-10, 2020 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Theory and applications of satisfiability testing - SAT 2020edited by Luca Pulina, Martina Seidl.
其他題名:	23rd International Conference, Alghero, Italy, July 3-10, 2020 : proceedings /
其他題名:	SAT 2020
其他作者:	Pulina, Luca.
團體作者:
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	xi, 538 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Computer algorithmsCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-51825-7
ISBN:	9783030518257$q(electronic bk.)

Theory and applications of satisfiability testing - SAT 202023rd International Conference, Alghero, Italy, July 3-10, 2020 : proceedings /
Theory and applications of satisfiability testing - SAT 202023rd International Conference, Alghero, Italy, July 3-10, 2020 : proceedings /[electronic resource] :SAT 2020edited by Luca Pulina, Martina Seidl. - Cham :Springer International Publishing :2020. - xi, 538 p. :ill., digital ;24 cm. - Lecture notes in computer science,121780302-9743 ;. - Lecture notes in computer science ;4891..

This book constitutes the proceedings of the 23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020, which was planned to take place in Alghero, Italy, during July 5-9, 2020. Due to the coronavirus COVID-19 pandemic, the conference was held virtually. The 25 full, 9 short, and 2 tool papers presented in this volume were carefully reviewed and selected from 69 submissions. They deal with SAT interpreted in a broad sense, including theoretical advances (such as 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, applications (including both novel application domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation.

ISBN: 9783030518257$q(electronic bk.)

Standard No.: 10.1007/978-3-030-51825-7doiSubjects--Topical Terms:

380777
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43 / S37 2020

Dewey Class. No.: 005.1

Theory and applications of satisfiability testing - SAT 202023rd International Conference, Alghero, Italy, July 3-10, 2020 : proceedings /
LDR:02152nmm a2200361 a 4500 001 592899
003 DE-He213
005 20200703163500.0
006 m d
007 cr nn 008maaau
008 210727s2020 sz s 0 eng d
020 $a 9783030518257$q(electronic bk.)
020 $a 9783030518240$q(paper)
024 7 $a 10.1007/978-3-030-51825-7 $2 doi
035 $a 978-3-030-51825-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b S37 2020
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 005.1 $2 23
090 $a QA76.9.A43 $b S253 2020
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Theory and applications of satisfiability testing - SAT 2020 $h [electronic resource] : $b 23rd International Conference, Alghero, Italy, July 3-10, 2020 : proceedings / $c edited by Luca Pulina, Martina Seidl.
246 3 $a SAT 2020
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xi, 538 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12178
490 1 $a Theoretical computer science and general issues
520 $a This book constitutes the proceedings of the 23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020, which was planned to take place in Alghero, Italy, during July 5-9, 2020. Due to the coronavirus COVID-19 pandemic, the conference was held virtually. The 25 full, 9 short, and 2 tool papers presented in this volume were carefully reviewed and selected from 69 submissions. They deal with SAT interpreted in a broad sense, including theoretical advances (such as 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, applications (including both novel application domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation.
650 0 $a Computer algorithms $v Congresses. $3 380777
650 0 $a Computer software $x Verification $v Congresses. $3 443711
650 1 4 $a Theory of Computation. $3 274475
650 2 4 $a Computer Systems Organization and Communication Networks. $3 273709
650 2 4 $a Control Structures and Microprogramming. $3 274663
650 2 4 $a Numeric Computing. $3 275524
650 2 4 $a Logic in AI. $3 836108
650 2 4 $a Software Engineering. $3 274511
700 1 $a Pulina, Luca. $3 884091
700 1 $a Seidl, Martina. $3 683671
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-51825-7
950 $a Computer Science (SpringerNature-11645)