東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Theory and applications of satisfiab...

SAT (Conference) (2020 :)

Linked to FindBook

Google Book

Amazon

博客來

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

Record Type:	Electronic resources : Monograph/item
Title/Author:	Theory and applications of satisfiability testing - SAT 2020/ edited by Luca Pulina, Martina Seidl.
Reminder of title:	23rd International Conference, Alghero, Italy, July 3-10, 2020 : proceedings /
remainder title:	SAT 2020
other author:	Pulina, Luca.
corporate name:	SAT (Conference)
Published:	Cham :Springer International Publishing : : 2020.,
Description:	xi, 538 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Computer algorithms - Congresses. -
Online resource:	https://doi.org/10.1007/978-3-030-51825-7
ISBN:	9783030518257

Theory and applications of satisfiability testing - SAT 2020 = 23rd 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 ;12178..

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

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

576357
Computer algorithms
--Congresses.

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

Dewey Class. No.: 005.1

Theory and applications of satisfiability testing - SAT 2020 = 23rd International Conference, Alghero, Italy, July 3-10, 2020 : proceedings /
LDR:02152nmm a2200361 a 4500 001 2257977
003 DE-He213
005 20200703163500.0
006 m d
007 cr nn 008maaau
008 220420s2020 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 $a SAT (Conference) $n (23rd : $d 2020 : $c Online) $3 3529652
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 $x Congresses. $3 576357
650 0 $a Computer software $x Verification $v Congresses. $3 844546
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Computer Systems Organization and Communication Networks. $3 891212
650 2 4 $a Control Structures and Microprogramming. $3 895886
650 2 4 $a Numeric Computing. $3 892606
650 2 4 $a Logic in AI. $3 3386372
650 2 4 $a Software Engineering. $3 890874
700 1 $a Pulina, Luca. $3 3529653
700 1 $a Seidl, Martina. $3 2072425
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 12178. $3 3529654
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-51825-7
950 $a Computer Science (SpringerNature-11645)