000 05137nam a22006135i 4500
001 978-3-319-40970-2
003 DE-He213
005 20210120143408.0
007 cr nn 008mamaa
008 160610s2016 gw | s |||| 0|eng d
020 _a9783319409702
_9978-3-319-40970-2
024 7 _a10.1007/978-3-319-40970-2
_2doi
050 4 _aQA75.5-76.95
050 4 _aQA76.63
072 7 _aUY
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUY
_2thema
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aTheory and Applications of Satisfiability Testing – SAT 2016
_h[electronic resource] :
_b19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings /
_cedited by Nadia Creignou, Daniel Le Berre.
250 _a1st ed. 2016.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2016.
300 _aXXIV, 564 p. 119 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 ;
_v9710
_aLecture Notes in Computer Science
_v9710
505 0 _aParameterized Compilation Lower Bounds for Restricted CNF-formulas -- Satisfiability via Smooth Pictures -- Solution-Graphs of Boolean Formulas and Isomorphism -- Strong Backdoors for Default Logic -- The Normalized Autocorrelation Length of Max r-Sat Converges in Probability to (1-1/2=r)/r -- Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle -- Extreme Cases in SAT Problems -- Improved Static Symmetry Breaking for SAT -- Learning Rate Based Branching Heuristic for SAT Solvers -- On the Hardness of SAT with Community Structure -- Trade-offs between Time and Memory in a Tighter Model of CDCL SAT Solvers -- A SAT Approach to Branch Width -- Computing Maximum Unavoidable Subgraphs Using SAT Solvers -- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT -- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer -- Deciding Bit-Vector Formulas with mcSAT -- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams -- Speeding Up the Constraint-Based Method in Difference Logic -- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers -- Finding Finite Models in Multi-Sorted First Order Logic -- MCS Extraction with Sublinear Oracle Queries -- Predicate Elimination for Preprocessing in First-Order Theorem Proving -- Quantified Boolean Formula Incremental Determinization -- Non-prenex QBF Solving using Abstraction -- On Q-Resolution and CDCL QBF Solving -- On Stronger Calculi for QBFs -- Q-Resolution with Generalized Axioms -- 2QBF: Challenges and Solutions -- Dependency Schemes for DQBF -- Lifting QBF Resolution Calculi to DQBF -- Long Distance Q-Resolution with Dependency Schemes -- BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies -- HordeQBF: A Modular and Massively Parallel QBF Solver -- LMHS: A SAT-IP Hybrid MaxSAT Solver -- OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing -- SpyBug: Automated Bug Detection in the Con_guration Space of SAT Solvers. .
520 _aThis book constitutes the refereed proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016, held in Bordeaux, France, in July 2016. The 31 regular papers, 5 tool papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers address different aspects of SAT, including complexity, satisfiability solving, satisfiability applications, satisfiability modulop theory, beyond SAT, quantified Boolean formula, and dependency QBF. .
650 0 _aComputers.
650 0 _aArtificial intelligence.
650 0 _aComputer science—Mathematics.
650 0 _aSoftware engineering.
650 1 4 _aTheory of Computation.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16005
650 2 4 _aArtificial Intelligence.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I21000
650 2 4 _aMathematics of Computing.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I17001
650 2 4 _aSoftware Engineering.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I14029
700 1 _aCreignou, Nadia.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLe Berre, Daniel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319409696
776 0 8 _iPrinted edition:
_z9783319409719
830 0 _aTheoretical Computer Science and General Issues ;
_v9710
830 0 _aLecture Notes in Computer Science ;
_v9710
856 4 0 _uhttps://doi.org/10.1007/978-3-319-40970-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c58142
_d58142