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.).
Contributor(s): Giunchiglia, Enrico | Tacchella, ArmandoMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 2919.Publisher: Berlin ; New York : Springer, ©2004Description: 1 online resource (xi, 530 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 3540246053; 9783540246053; 1280306734; 9781280306730Subject(s): Propositional calculus -- Congresses | Decision making -- Congresses | Computer algorithms -- Congresses | Algorithmes -- Congrès | Calcul propositionnel -- Congrès | Prise de décision -- Congrès | MATHEMATICS -- Infinity | MATHEMATICS -- Logic | Computer algorithms | Decision making | Propositional calculus | Boolesche Formel | Erfüllbarkeitsproblem | Kongress | Calcul des propositions | Prise de décision (Mathématiques) | AlgorithmeGenre/Form: Electronic books. | Conference papers and proceedings. | Santa Margherita Ligure (2003) Additional physical formats: Print version:: Theory and applications of satisfiability testing.DDC classification: 511.3 LOC classification: QA9.3 | .S365 2003Other classification: 31.10 | 54.10 | 54.72 | SS 4800 | DAT 540f | DAT 706f | DAT 517f | MAT 030f Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
This book constitutes the thoroughly refereed post-proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing, SAT 2003, held in Santa Margherita Ligure, Italy, in May 2003. The 33 revised full papers presented together with 5 articles reporting results of the related SAT competition and QBF evaluation were carefully selected during two rounds of reviewing and improvement from 67 submissions. The whole spectrum of research in propositional and quantified Boolean formula satisfiability testing is covered including proof systems, search techniques, probabilistic analysis of algorithms and their properties, problem encodings, industrial applications, specific tools, case studies, and empirical results.
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 Vertex Eccentricity 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.