000 | 04529nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-540-24605-3 | ||
003 | DE-He213 | ||
005 | 20240423125316.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2004 gw | s |||| 0|eng d | ||
020 |
_a9783540246053 _9978-3-540-24605-3 |
||
024 | 7 |
_a10.1007/b95238 _2doi |
|
050 | 4 | _aQA8.9-10.3 | |
072 | 7 |
_aPBCD _2bicssc |
|
072 | 7 |
_aPBC _2bicssc |
|
072 | 7 |
_aMAT018000 _2bisacsh |
|
072 | 7 |
_aPBCD _2thema |
|
072 | 7 |
_aPBC _2thema |
|
082 | 0 | 4 |
_a511.3 _223 |
245 | 1 | 0 |
_aTheory and Applications of Satisfiability Testing _h[electronic resource] : _b6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003, Selected Revised Papers / _cedited by Enrico Giunchiglia, Armando Tacchella. |
250 | _a1st ed. 2004. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2004. |
|
300 |
_aXI, 530 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2919 |
|
505 | 0 | _aSatisfiability and Computing van der Waerden Numbers -- An Algorithm for SAT Above the Threshold -- Watched Data Structures for QBF Solvers -- How Good Can a Resolution Based SAT-solver Be? -- A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation -- Density Condensation of Boolean Formulas -- SAT Based Predicate Abstraction for Hardware Verification -- On Boolean Models for Quantified Boolean Horn Formulas -- Local Search on SAT-encoded Colouring Problems -- A Study of Pure Random Walk on Random Satisfiability Problems with “Physical” Methods -- Hidden Threshold Phenomena for Fixed-Density SAT-formulae -- Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs -- Width-Based Algorithms for SAT and CIRCUIT-SAT -- Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems -- On Fixed-Parameter Tractable Parameterizations of SAT -- On the Probabilistic Approach to the Random Satisfiability Problem -- Comparing Different Prenexing Strategies for Quantified Boolean Formulas -- Solving Error Correction for Large Data Sets by Means of a SAT Solver -- Using Problem Structure for Efficient Clause Learning -- Abstraction-Driven SAT-based Analysis of Security Protocols -- A Case for Efficient Solution Enumeration -- Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms -- Local Consistencies in SAT -- Guiding SAT Diagnosis with Tree Decompositions -- On Computing k-CNF Formula Properties -- Effective Preprocessing with Hyper-Resolution and Equality Reduction -- Read-Once Unit Resolution -- The Interaction Between Inference and Branching Heuristics -- Hypergraph Reductions and Satisfiability Problems -- SBSAT: a State-Based, BDD-Based Satisfiability Solver -- Computing VertexEccentricity in Exponentially Large Graphs: QBF Formulation and Solution -- The Combinatorics of Conflicts between Clauses -- Conflict-Based Selection of Branching Rules -- The Essentials of the SAT 2003 Competition -- Challenges in the QBF Arena: the SAT’03 Evaluation of QBF Solvers -- kcnfs: An Efficient Solver for Random k-SAT Formulae -- An Extensible SAT-solver -- Survey and Belief Propagation on Random K-SAT. | |
650 | 0 | _aMathematical logic. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aNumerical analysis. | |
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aMathematical Logic and Foundations. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aNumerical Analysis. |
650 | 2 | 4 | _aArtificial Intelligence. |
700 | 1 |
_aGiunchiglia, Enrico. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aTacchella, Armando. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540208518 |
776 | 0 | 8 |
_iPrinted edition: _z9783662208441 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2919 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b95238 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c176543 _d176543 |