|
|
|
|
| LEADER |
03623nmm a2200385 u 4500 |
| 001 |
EB000652104 |
| 003 |
EBX01000000000000000505186 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540246053
|
| 100 |
1 |
|
|a Giunchiglia, Enrico
|e [editor]
|
| 245 |
0 |
0 |
|a Theory and Applications of Satisfiability Testing
|h Elektronische Ressource
|b 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003, Selected Revised Papers
|c edited by Enrico Giunchiglia, Armando Tacchella
|
| 250 |
|
|
|a 1st ed. 2004
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2004, 2004
|
| 300 |
|
|
|a XI, 530 p
|b online resource
|
| 505 |
0 |
|
|a 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 --
|
| 505 |
0 |
|
|a Satisfiability 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 --
|
| 505 |
0 |
|
|a 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.
|
| 653 |
|
|
|a Numerical Analysis
|
| 653 |
|
|
|a Mathematical logic
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Numerical analysis
|
| 653 |
|
|
|a Mathematical Logic and Foundations
|
| 700 |
1 |
|
|a Tacchella, Armando
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/b95238
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/b95238?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511.3
|