000 04783nam a22006135i 4500
001 978-3-642-14186-7
003 DE-He213
005 20240730192959.0
007 cr nn 008mamaa
008 100709s2010 gw | s |||| 0|eng d
020 _a9783642141867
_9978-3-642-14186-7
024 7 _a10.1007/978-3-642-14186-7
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aTheory and Applications of Satisfiability Testing - SAT 2010
_h[electronic resource] :
_b13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings /
_cedited by Ofer Strichman, Stefan Szeider.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXIII, 400 p. 74 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 ;
_v6175
505 0 _a1. Invited Talks -- The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference -- Exact Algorithms and Complexity -- 2. Regular Papers -- Improving Stochastic Local Search for SAT with a New Probability Distribution -- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas -- Proof Complexity of Propositional Default Logic -- Automated Testing and Debugging of SAT and QBF Solvers -- Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN -- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT -- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning -- Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold -- Symmetry and Satisfiability: An Update -- A Non-prenex, Non-clausal QBF Solver with Game-State Learning -- SAT Solving with Reference Points -- Integrating Dependency Schemes in Search-Based QBF Solvers -- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF -- Improving Unsatisfiability-Based Algorithms for Boolean Optimization -- Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs -- Statistical Methodology for Comparison of SAT Solvers -- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem -- The Seventh QBF Solvers Evaluation (QBFEVAL'10) -- Complexity Results for Linear XSAT-Problems -- Bounds on Threshold of Regular Random k-SAT -- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT -- 3. Short Papers -- Improved Local Search for Circuit Satisfiability -- A System for Solving Constraint Satisfaction Problems with SMT -- Two Techniques for Minimizing Resolution Proofs -- On Moderately Exponential Time for SAT -- MinimisingDeterministic Büchi Automata Precisely Using SAT Solving -- Exploiting Circuit Representations in QBF Solving -- Reconstructing Solutions after Blocked Clause Elimination -- An Empirical Study of Optimal Noise and Runtime Distributions in Local Search -- Green-Tao Numbers and SAT -- Exact MinSAT Solving -- Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable -- Assignment Stack Shrinking -- Simple but Hard Mixed Horn Formulas -- Zero-One Designs Produce Small Hard SAT Instances.
650 0 _aAlgorithms.
_93390
650 0 _aSoftware engineering.
_94138
650 0 _aComputer programming.
_94169
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9152003
650 0 _aComputer science
_xMathematics.
_93866
650 1 4 _aAlgorithms.
_93390
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aProgramming Techniques.
_9152004
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aFormal Languages and Automata Theory.
_9152005
650 2 4 _aMathematics of Computing.
_931875
700 1 _aStrichman, Ofer.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9152006
700 1 _aSzeider, Stefan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9152007
710 2 _aSpringerLink (Online service)
_9152008
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642141850
776 0 8 _iPrinted edition:
_z9783642141874
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6175
_9152009
856 4 0 _uhttps://doi.org/10.1007/978-3-642-14186-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94535
_d94535