Skip to main content
  • Conference proceedings
  • © 2004

Theory and Applications of Satisfiability Testing

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

Conference proceedings info: SAT 2003.

Buy it now

Buying options

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

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

Table of contents (38 papers)

  1. Front Matter

  2. Satisfiability and Computing van der Waerden Numbers

    • Michael R. Dransfield, Victor W. Marek, Mirosław Truszczyński
    Pages 1-13
  3. Watched Data Structures for QBF Solvers

    • Ian Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew Rowley, Armando Tacchella
    Pages 25-36
  4. How Good Can a Resolution Based SAT-solver Be?

    • Eugene Goldberg, Yakov Novikov
    Pages 37-52
  5. Density Condensation of Boolean Formulas

    • Youichi Hanatani, Takashi Horiyama, Kazuo Iwama
    Pages 69-77
  6. SAT Based Predicate Abstraction for Hardware Verification

    • Edmund Clarke, Muralidhar Talupur, Helmut Veith, Dong Wang
    Pages 78-92
  7. On Boolean Models for Quantified Boolean Horn Formulas

    • Hans Kleine Büning, K. Subramani, Xishun Zhao
    Pages 93-104
  8. Local Search on SAT-encoded Colouring Problems

    • Steven Prestwich
    Pages 105-119
  9. Hidden Threshold Phenomena for Fixed-Density SAT-formulae

    • Hans van Maaren, Linda van Norden
    Pages 135-149
  10. Width-Based Algorithms for SAT and CIRCUIT-SAT

    • Elizabeth Broering, Satyanarayana V. Lokam
    Pages 162-171
  11. Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems

    • Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
    Pages 172-187
  12. Comparing Different Prenexing Strategies for Quantified Boolean Formulas

    • Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda
    Pages 214-228
  13. Using Problem Structure for Efficient Clause Learning

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

Other Volumes

  1. Theory and Applications of Satisfiability Testing

Editors and Affiliations

  • DIST, Università di Genova, Genova, Italy

    Enrico Giunchiglia, Armando Tacchella

Bibliographic Information

Buy it now

Buying options

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