國立虎尾科技大學 |

Theory and Applications of Satisfiability Testing – SAT 2019 = 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Theory and Applications of Satisfiability Testing – SAT 2019/ edited by Mikoláš Janota, Inês Lynce.
Reminder of title:	22nd International Conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019, Proceedings /
other author:	Janota, Mikoláš.
Description:	XIV, 425 p. 515 illus., 37 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computers. -
Online resource:	https://doi.org/10.1007/978-3-030-24258-9
ISBN:	9783030242589

Theory and Applications of Satisfiability Testing – SAT 2019 = 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019, Proceedings /
Theory and Applications of Satisfiability Testing – SAT 201922nd International Conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019, Proceedings /[electronic resource] :edited by Mikoláš Janota, Inês Lynce. - 1st ed. 2019. - XIV, 425 p. 515 illus., 37 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11628. - Theoretical Computer Science and General Issues ;9163.

Computational Sustainability: Computing for a Better World -- Machine Learning in Automated and Interactive Theorem Proving -- Circular (Yet Sound) Proofs -- Short Proofs in QBF Expansion -- Proof Complexity of QBF Symmetry Recomputation -- Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model -- DRAT Proofs, Propagation Redundancy, and Extended Resolution -- Knowledge Compilation Languages as Proof Systems -- The Equivalences of Refutational QRAT -- A SAT-based System for Consistent Query Answering -- Incremental Inprocessing in SAT Solving -- Local Search for Fast Matrix Multiplication -- Speeding Up Assumption-Based SAT -- Simplifying CDCL Clause Database Reduction -- QRAT Polynomially Simulates nforall-Exp+Res -- QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties -- On Computing the Union of MUSes -- Revisiting Graph Width Measures for CNF-Encodings -- DRMaxSAT with MaxHS: First Contact -- Backing Backtracking -- Assessing Heuristic Machine Learning Explanations with Model Counting -- Syntax-Guided Rewrite Rule Enumeration for SMT Solvers -- DRAT-based Bit-Vector Proofs in CVC4 -- Combining Resolution-Path Dependencies with Dependency Learning -- Proof Complexity of Fragments of Long-Distance Q-Resolution -- Guiding High-Performance SAT Solvers with Unsat-Core Predictions -- Verifying Binarized Neural Networks by Angluin-Style Learning -- CrystalBall: Gazing in the Black Box of SAT Solving -- Clausal Abstraction for DQBF -- On Super Strong ETH. .

This book constitutes the refereed proceedings of the 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019, held in Lisbon, Portugal, UK, in July 2019. The 19 revised full papers presented together with 7 short papers were carefully reviewed and selected from 64 submissions. The papers address different aspects of SAT interpreted in a broad sense, including (but not restricted to) 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: 9783030242589

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

565115
Computers.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Theory and Applications of Satisfiability Testing – SAT 2019 = 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019, Proceedings /
LDR:03943nam a22004335i 4500 001 1009865
003 DE-He213
005 20200705155244.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030242589 $9 978-3-030-24258-9
024 7 $a 10.1007/978-3-030-24258-9 $2 doi
035 $a 978-3-030-24258-9
050 4 $a QA75.5-76.95
050 4 $a QA76.63
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 004.0151 $2 23
245 1 0 $a Theory and Applications of Satisfiability Testing – SAT 2019 $h [electronic resource] : $b 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019, Proceedings / $c edited by Mikoláš Janota, Inês Lynce.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XIV, 425 p. 515 illus., 37 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11628
505 0 $a Computational Sustainability: Computing for a Better World -- Machine Learning in Automated and Interactive Theorem Proving -- Circular (Yet Sound) Proofs -- Short Proofs in QBF Expansion -- Proof Complexity of QBF Symmetry Recomputation -- Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model -- DRAT Proofs, Propagation Redundancy, and Extended Resolution -- Knowledge Compilation Languages as Proof Systems -- The Equivalences of Refutational QRAT -- A SAT-based System for Consistent Query Answering -- Incremental Inprocessing in SAT Solving -- Local Search for Fast Matrix Multiplication -- Speeding Up Assumption-Based SAT -- Simplifying CDCL Clause Database Reduction -- QRAT Polynomially Simulates nforall-Exp+Res -- QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties -- On Computing the Union of MUSes -- Revisiting Graph Width Measures for CNF-Encodings -- DRMaxSAT with MaxHS: First Contact -- Backing Backtracking -- Assessing Heuristic Machine Learning Explanations with Model Counting -- Syntax-Guided Rewrite Rule Enumeration for SMT Solvers -- DRAT-based Bit-Vector Proofs in CVC4 -- Combining Resolution-Path Dependencies with Dependency Learning -- Proof Complexity of Fragments of Long-Distance Q-Resolution -- Guiding High-Performance SAT Solvers with Unsat-Core Predictions -- Verifying Binarized Neural Networks by Angluin-Style Learning -- CrystalBall: Gazing in the Black Box of SAT Solving -- Clausal Abstraction for DQBF -- On Super Strong ETH. .
520 $a This book constitutes the refereed proceedings of the 22nd International Conference on Theory and Applications of Satisfiability Testing, SAT 2019, held in Lisbon, Portugal, UK, in July 2019. The 19 revised full papers presented together with 7 short papers were carefully reviewed and selected from 64 submissions. The papers address different aspects of SAT interpreted in a broad sense, including (but not restricted to) 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 Computers. $3 565115
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer logic. $3 786340
650 0 $a Numerical analysis. $3 527939
650 0 $a Software engineering. $3 562952
650 0 $a Computer system failures. $3 782237
650 1 4 $a Theory of Computation. $3 669322
650 2 4 $a Logic in AI. $3 1228083
650 2 4 $a Numeric Computing. $3 669943
650 2 4 $a Software Engineering. $3 669632
650 2 4 $a System Performance and Evaluation. $3 669346
650 2 4 $a The Computing Profession. $3 669954
700 1 $a Janota, Mikoláš. $e editor. $1 https://orcid.org/0000-0003-3487-784X $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1303875
700 1 $a Lynce, Inês. $e editor. $1 https://orcid.org/0000-0003-4868-415X $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1303876
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030242572
776 0 8 $i Printed edition: $z 9783030242596
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-24258-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)