Theory and applications of satisfiability testing : 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003 : selected revised papers
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
2919 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
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 |
| LEADER | 04911nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 970648 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155194127 | ||
| 020 | |a 9783540246053 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International Conference on Theory and Applications of Satisfiability Testing |n (06 |d :2003 |c :Santa Margherita Ligure, Italie). | |
| 245 | 1 | 0 | |a Theory and applications of satisfiability testing : |b 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003 : selected revised papers |c [edited by] Enrico Giunchiglia, Armando Tacchella. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2919 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 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 -- 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Intelligence artificielle | ||
| 650 | |a Analyse numérique | ||
| 650 | |a Prise de décision | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Calcul des propositions | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Giunchiglia, Enrico. |4 pbd | |
| 700 | 1 | |a Tacchella, Armando. |4 pbd | |
| 776 | 0 | |0 076598683 |t Theory and applications of satisfiability testing |o 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003 |o selected revised papers |f Enrico Giunchiglia, Armando Tacchella (Eds.) |c Berlin |n Springer |d 2004 |p 1 vol. (XI-530 p.) |s Lecture notes in computer science |z 3-540-20851-8 | |
| 776 | 0 | |t Theory and Applications of Satisfiability Testing |b Texte imprimé |z 9783662208441 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b95238 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-54MW7423-T |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750661003 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b95238 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754010589 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b95238 |z Accès INSA CVL | |
| 997 | |0 970648 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||