000 | 04861nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-030-24258-9 | ||
003 | DE-He213 | ||
005 | 20240730164451.0 | ||
007 | cr nn 008mamaa | ||
008 | 190628s2019 sz | s |||| 0|eng d | ||
020 |
_a9783030242589 _9978-3-030-24258-9 |
||
024 | 7 |
_a10.1007/978-3-030-24258-9 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aTheory and Applications of Satisfiability Testing - SAT 2019 _h[electronic resource] : _b22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings / _cedited by Mikoláš Janota, Inês Lynce. |
250 | _a1st ed. 2019. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2019. |
|
300 |
_aXIV, 425 p. 515 illus., 37 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v11628 |
|
505 | 0 | _aComputational 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 | _aThis 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 |
_aComputer science. _99832 |
|
650 | 0 |
_aLogic programming. _92730 |
|
650 | 0 |
_aNumerical analysis. _94603 |
|
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aElectronic digital computers _xEvaluation. _921495 |
|
650 | 0 |
_aComputers. _98172 |
|
650 | 0 |
_aProfessions. _984435 |
|
650 | 1 | 4 |
_aTheory of Computation. _984618 |
650 | 2 | 4 |
_aLogic in AI. _933012 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aSystem Performance and Evaluation. _932047 |
650 | 2 | 4 |
_aThe Computing Profession. _984437 |
700 | 1 |
_aJanota, Mikoláš. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _984620 |
|
700 | 1 |
_aLynce, Inês. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _984621 |
|
710 | 2 |
_aSpringerLink (Online service) _984623 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030242572 |
776 | 0 | 8 |
_iPrinted edition: _z9783030242596 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v11628 _984625 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-24258-9 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c85695 _d85695 |