國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Theory and applications of satisfiab...

(1998 :)

Theory and applications of satisfiability testing - SAT 201922nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Theory and applications of satisfiability testing - SAT 2019edited by Mikolas Janota, Ines Lynce.
其他題名:	22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019 : proceedings /
其他題名:	SAT 2019
其他作者:	Janota, Mikolas.
團體作者:
出版者:	Cham :Springer International Publishing :2019.
面頁冊數:	xiv, 425 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer algorithmsCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-24258-9
ISBN:	9783030242589$q(electronic bk.)

Theory and applications of satisfiability testing - SAT 201922nd 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] :SAT 2019edited by Mikolas Janota, Ines Lynce. - Cham :Springer International Publishing :2019. - xiv, 425 p. :ill., digital ;24 cm. - Lecture notes in computer science,116280302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

380777
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Theory and applications of satisfiability testing - SAT 201922nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019 : proceedings /
LDR:03625nmm a2200373 a 4500 001 562744
003 DE-He213
005 20190628220031.0
006 m d
007 cr nn 008maaau
008 200227s2019 gw s 0 eng d
020 $a 9783030242589$q(electronic bk.)
020 $a 9783030242572$q(paper)
024 7 $a 10.1007/978-3-030-24258-9 $2 doi
035 $a 978-3-030-24258-9
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 2019
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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 Mikolas Janota, Ines Lynce.
246 3 $a SAT 2019
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xiv, 425 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11628
490 1 $a Theoretical computer science and general issues
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 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 Logic in AI. $3 836108
650 2 4 $a Numeric Computing. $3 275524
650 2 4 $a Software Engineering. $3 274511
650 2 4 $a System Performance and Evaluation. $3 273898
650 2 4 $a The Computing Profession. $3 275271
700 1 $a Janota, Mikolas. $3 847992
700 1 $a Lynce, Ines. $3 847993
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
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-24258-9
950 $a Computer Science (Springer-11645)