000 03575nam a22006255i 4500
001 978-3-319-94144-8
003 DE-He213
005 20240730182449.0
007 cr nn 008mamaa
008 180625s2018 sz | s |||| 0|eng d
020 _a9783319941448
_9978-3-319-94144-8
024 7 _a10.1007/978-3-319-94144-8
_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 2018
_h[electronic resource] :
_b21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings /
_cedited by Olaf Beyersdorff, Christoph M. Wintersteiger.
250 _a1st ed. 2018.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2018.
300 _aXIX, 452 p. 73 illus.
_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 ;
_v10929
520 _aThis 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 _aComputer science.
_99832
650 0 _aArtificial intelligence.
_93407
650 0 _aSoftware engineering.
_94138
650 0 _aComputer programming.
_94169
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aTheory of Computation.
_9128223
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aProgramming Techniques.
_9128224
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aData Science.
_934092
700 1 _aBeyersdorff, Olaf.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9128225
700 1 _aWintersteiger, Christoph M.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9128226
710 2 _aSpringerLink (Online service)
_9128227
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319941431
776 0 8 _iPrinted edition:
_z9783319941455
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10929
_9128228
856 4 0 _uhttps://doi.org/10.1007/978-3-319-94144-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91369
_d91369