國立高雄大學圖資館 |

Language: English

Back

Theory and applications of satisfiab...

(1998 :)

Theory and applications of satisfiability testing - SAT 202124th International Conference, Barcelona, Spain, July 5-9, 2021 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Theory and applications of satisfiability testing - SAT 2021edited by Chu-Min Li, Felip Manya.
Reminder of title:	24th International Conference, Barcelona, Spain, July 5-9, 2021 : proceedings /
remainder title:	SAT 2021
other author:	Li, Chu-Min.
corporate name:
Published:	Cham :Springer International Publishing :2021.
Description:	xi, 564 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Computer algorithmsCongresses.
Online resource:	https://doi.org/10.1007/978-3-030-80223-3
ISBN:	9783030802233$q(electronic bk.)

Theory and applications of satisfiability testing - SAT 202124th International Conference, Barcelona, Spain, July 5-9, 2021 : proceedings /
Theory and applications of satisfiability testing - SAT 202124th International Conference, Barcelona, Spain, July 5-9, 2021 : proceedings /[electronic resource] :SAT 2021edited by Chu-Min Li, Felip Manya. - Cham :Springer International Publishing :2021. - xi, 564 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,128310302-9743 ;. - Lecture notes in computer science ;4891..

This book constitutes the proceedings of the 24th International Conference on Theory and Applications of Satisfiability Testing, SAT 2021, which took place in Barcelona, Spain, in July 2021. The 37 full papers presented in this volume were carefully reviewed and selected from 73 submissions. They deal with theory and applications of the propositional satisfiability problem, broadly construed. Aside from plain propositional satisfiability, the scope of the meeting includes Boolean optimization, including MaxSAT and pseudo-Boolean (PB) constraints, quantified Boolean formulas (QBF), satisfiability modulo theories (SMT), and constraint programming (CP) for problems with clear connections to Boolean reasoning.

ISBN: 9783030802233$q(electronic bk.)

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

380777
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Theory and applications of satisfiability testing - SAT 202124th International Conference, Barcelona, Spain, July 5-9, 2021 : proceedings /
LDR:01963nmm a2200361 a 4500 001 602055
003 DE-He213
005 20210702191339.0
006 m d
007 cr nn 008maaau
008 211112s2021 sz s 0 eng d
020 $a 9783030802233$q(electronic bk.)
020 $a 9783030802226$q(paper)
024 7 $a 10.1007/978-3-030-80223-3 $2 doi
035 $a 978-3-030-80223-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 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 2021
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Theory and applications of satisfiability testing - SAT 2021 $h [electronic resource] : $b 24th International Conference, Barcelona, Spain, July 5-9, 2021 : proceedings / $c edited by Chu-Min Li, Felip Manya.
246 3 $a SAT 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xi, 564 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12831
490 1 $a Theoretical computer science and general issues
520 $a This book constitutes the proceedings of the 24th International Conference on Theory and Applications of Satisfiability Testing, SAT 2021, which took place in Barcelona, Spain, in July 2021. The 37 full papers presented in this volume were carefully reviewed and selected from 73 submissions. They deal with theory and applications of the propositional satisfiability problem, broadly construed. Aside from plain propositional satisfiability, the scope of the meeting includes Boolean optimization, including MaxSAT and pseudo-Boolean (PB) constraints, quantified Boolean formulas (QBF), satisfiability modulo theories (SMT), and constraint programming (CP) for problems with clear connections to Boolean reasoning.
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 System Implementation. $3 276333
650 2 4 $a Logic in AI. $3 836108
650 2 4 $a Control Structures and Microprogramming. $3 274663
650 2 4 $a Special Purpose and Application-Based Systems. $3 274487
650 2 4 $a Software Engineering. $3 274511
700 1 $a Li, Chu-Min. $3 897646
700 1 $a Manya, Felip. $3 582664
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-80223-3
950 $a Computer Science (SpringerNature-11645)