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. Abstraction-Driven SAT-based Analysis of Security Protocols

    • Alessandro Armando, Luca Compagna
    Pages 257-271
  2. A Case for Efficient Solution Enumeration

    • Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, Daniel Jackson
    Pages 272-286
  3. Local Consistencies in SAT

    • Christian Bessière, Emmanuel Hebrard, Toby Walsh
    Pages 299-314
  4. Guiding SAT Diagnosis with Tree Decompositions

    • Per Bjesse, James Kukula, Robert Damiano, Ted Stanion, Yunshan Zhu
    Pages 315-329
  5. On Computing k-CNF Formula Properties

    • Ryan Williams
    Pages 330-340
  6. Effective Preprocessing with Hyper-Resolution and Equality Reduction

    • Fahiem Bacchus, Jonathan Winter
    Pages 341-355
  7. Read-Once Unit Resolution

    • Hans Kleine Büning, Xishun Zhao
    Pages 356-369
  8. The Interaction Between Inference and Branching Heuristics

    • Lyndon Drake, Alan Frisch
    Pages 370-382
  9. Hypergraph Reductions and Satisfiability Problems

    • Daniele Pretolani
    Pages 383-397
  10. SBSAT: a State-Based, BDD-Based Satisfiability Solver

    • John Franco, Michal Kouril, John Schlipf, Jeffrey Ward, Sean Weaver, Michael Dransfield et al.
    Pages 398-410
  11. The Combinatorics of Conflicts between Clauses

    • Oliver Kullmann
    Pages 426-440
  12. Conflict-Based Selection of Branching Rules

    • Marc Herbstritt, Bernd Becker
    Pages 441-451
  13. The Essentials of the SAT 2003 Competition

    • Daniel Le Berre, Laurent Simon
    Pages 452-467
  14. Challenges in the QBF Arena: the SAT’03 Evaluation of QBF Solvers

    • Daniel Le Berre, Laurent Simon, Armando Tacchella
    Pages 468-485
  15. kcnfs: An Efficient Solver for Random k-SAT Formulae

    • Gilles Dequen, Olivier Dubois
    Pages 486-501
  16. An Extensible SAT-solver

    • Niklas Eén, Niklas Sörensson
    Pages 502-518
  17. Survey and Belief Propagation on Random K-SAT

    • Alfredo Braunstein, Riccardo Zecchina
    Pages 519-528
  18. Back Matter

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