Skip to main content
SpringerLink
Log in

Theory and Applications of Satisfiability Testing

6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003, Selected Revised Papers

  • Conference proceedings
  • © 2004

Overview

Editors:
  1. Enrico Giunchiglia

    1. DIST, Università di Genova, Genova, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Armando Tacchella

    1. DIST, Università di Genova, Genova, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2919)

Included in the following conference series:

Conference proceedings info: SAT 2003.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (38 papers)

  1. Front Matter

    Download chapter PDF

  2. Satisfiability and Computing van der Waerden Numbers

    • Michael R. Dransfield, Victor W. Marek, Mirosław Truszczyński
    Pages 1-13

  3. An Algorithm for SAT Above the Threshold

    • Hubie Chen
    Pages 14-24

  4. Watched Data Structures for QBF Solvers

    • Ian Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew Rowley, Armando Tacchella
    Pages 25-36

  5. How Good Can a Resolution Based SAT-solver Be?

    • Eugene Goldberg, Yakov Novikov
    Pages 37-52

  6. A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation

    • Xiao Yu Li, Matthias F. Stallmann, Franc Brglez
    Pages 53-68

  7. Density Condensation of Boolean Formulas

    • Youichi Hanatani, Takashi Horiyama, Kazuo Iwama
    Pages 69-77

  8. SAT Based Predicate Abstraction for Hardware Verification

    • Edmund Clarke, Muralidhar Talupur, Helmut Veith, Dong Wang
    Pages 78-92

  9. On Boolean Models for Quantified Boolean Horn Formulas

    • Hans Kleine Büning, K. Subramani, Xishun Zhao
    Pages 93-104

  10. Local Search on SAT-encoded Colouring Problems

    • Steven Prestwich
    Pages 105-119

  11. A Study of Pure Random Walk on Random Satisfiability Problems with “Physical” Methods

    • Guilhem Semerjian, Rémi Monasson
    Pages 120-134

  12. Hidden Threshold Phenomena for Fixed-Density SAT-formulae

    • Hans van Maaren, Linda van Norden
    Pages 135-149

  13. Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs

    • Sven Baumer, Rainer Schuler
    Pages 150-161

  14. Width-Based Algorithms for SAT and CIRCUIT-SAT

    • Elizabeth Broering, Satyanarayana V. Lokam
    Pages 162-171

  15. Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems

    • Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
    Pages 172-187

  16. On Fixed-Parameter Tractable Parameterizations of SAT

    • Stefan Szeider
    Pages 188-202

  17. On the Probabilistic Approach to the Random Satisfiability Problem

    • Giorgio Parisi
    Pages 203-213

  18. Comparing Different Prenexing Strategies for Quantified Boolean Formulas

    • Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda
    Pages 214-228

  19. Solving Error Correction for Large Data Sets by Means of a SAT Solver

    • Renato Bruni
    Pages 229-241

  20. Using Problem Structure for Efficient Clause Learning

    • Ashish Sabharwal, Paul Beame, Henry Kautz
    Pages 242-256
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing

Keywords

Editors and Affiliations

  • DIST, Università di Genova, Genova, Italy

    Enrico Giunchiglia, Armando Tacchella

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation