Theory and applications of satisfiability testing : 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003 : selected revised papers
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science
2919 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Theory and applications of satisfiability testing, 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003, selected revised papers, Enrico Giunchiglia, Armando Tacchella (Eds.), Berlin, Springer, 2004, 1 vol. (XI-530 p.), Lecture notes in computer science, 3-540-20851-8 • Theory and Applications of Satisfiability Testing, Texte imprimé, 9783662208441 |
Inhaltsangabe:
- 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
- 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.