國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Theory and applications of satisfiab...

(1998 :)

Theory and applications of satisfiability testing - SAT 201821st International Conference, SAT 2018, held as part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Theory and applications of satisfiability testing - SAT 2018edited by Olaf Beyersdorff, Christoph M. Wintersteiger.
其他題名:	21st International Conference, SAT 2018, held as part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018 : proceedings /
其他題名:	SAT 2018
其他作者:	Beyersdorff, Olaf.
團體作者:
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	xix, 452 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer algorithmsCongresses.
電子資源:	http://dx.doi.org/10.1007/978-3-319-94144-8
ISBN:	9783319941448$q(electronic bk.)

Theory and applications of satisfiability testing - SAT 201821st International Conference, SAT 2018, held as part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018 : proceedings /
Theory and applications of satisfiability testing - SAT 201821st International Conference, SAT 2018, held as part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018 : proceedings /[electronic resource] :SAT 2018edited by Olaf Beyersdorff, Christoph M. Wintersteiger. - Cham :Springer International Publishing :2018. - xix, 452 p. :ill., digital ;24 cm. - Lecture notes in computer science,109290302-9743 ;. - Lecture notes in computer science ;4891..

This book constitutes the refereed proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018, held in Oxford, UK, in July 2018. The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers address different aspects of 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 as well as case studies and reports on findings based on rigorous experimentation. They are organized in the following topical sections: maximum satisfiability; conflict driven clause learning; model counting; quantified Boolean formulae; theory; minimally unsatisfiable sets; satisfiability modulo theories; and tools and applications.

ISBN: 9783319941448$q(electronic bk.)

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

380777
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Theory and applications of satisfiability testing - SAT 201821st International Conference, SAT 2018, held as part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018 : proceedings /
LDR:02272nmm a2200361 a 4500 001 540530
003 DE-He213
005 20180625104014.0
006 m d
007 cr nn 008maaau
008 190308s2018 gw s 0 eng d
020 $a 9783319941448$q(electronic bk.)
020 $a 9783319941431$q(paper)
024 7 $a 10.1007/978-3-319-94144-8 $2 doi
035 $a 978-3-319-94144-8
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 2018
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Theory and applications of satisfiability testing - SAT 2018 $h [electronic resource] : $b 21st International Conference, SAT 2018, held as part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018 : proceedings / $c edited by Olaf Beyersdorff, Christoph M. Wintersteiger.
246 3 $a SAT 2018
246 3 $a FloC 2018
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xix, 452 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10929
520 $a This book constitutes the refereed proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018, held in Oxford, UK, in July 2018. The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers address different aspects of 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 as well as case studies and reports on findings based on rigorous experimentation. They are organized in the following topical sections: maximum satisfiability; conflict driven clause learning; model counting; quantified Boolean formulae; theory; minimally unsatisfiable sets; satisfiability modulo theories; and tools and applications.
650 0 $a Computer algorithms $v Congresses. $3 380777
650 0 $a Computer software $x Verification $v Congresses. $3 443711
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Theory of Computation. $3 274475
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 252959
650 2 4 $a Software Engineering. $3 274511
650 2 4 $a Programming Techniques. $3 274470
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Data Structures. $3 273992
700 1 $a Beyersdorff, Olaf. $3 818786
700 1 $a Wintersteiger, Christoph M. $3 818787
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-94144-8
950 $a Computer Science (Springer-11645)