|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-642-14186-7 |
| 003 |
DE-He213 |
| 005 |
20230221152126.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100709s2010 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642141867
|9 978-3-642-14186-7
|
| 024 |
7 |
|
|a 10.1007/978-3-642-14186-7
|2 doi
|
| 050 |
|
4 |
|a QA76.9.A43
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM051300
|2 bisacsh
|
| 072 |
|
7 |
|a UMB
|2 thema
|
| 082 |
0 |
4 |
|a 518.1
|2 23
|
| 245 |
1 |
0 |
|a Theory and Applications of Satisfiability Testing - SAT 2010
|h [electronic resource] :
|b 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings /
|c edited by Ofer Strichman, Stefan Szeider.
|
| 250 |
|
|
|a 1st ed. 2010.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
| 300 |
|
|
|a XIII, 400 p. 74 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6175
|
| 505 |
0 |
|
|a 1. 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 -- Minimising Deterministic 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 |
|a Algorithms.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
1 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 700 |
1 |
|
|a Strichman, Ofer.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Szeider, Stefan.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642141850
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642141874
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6175
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-14186-7
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
