Skip to main content
SpringerLink
Log in

Theory and Applications of Satisfiability Testing

7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Holger H. Hoos

    1. Department of Computer Science, University of British Columbia Vancouver, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. David G. Mitchell

    1. Computational Logic Laboratory, Simon Fraser University, Burnaby, Canada

    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 3542)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: SAT 2004.

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 (28 papers)

  1. Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables

    1. Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems

      • Stefan Porschen, Ewald Speckenmeyer
      Pages 251-262

    2. Satisfiability Threshold of the Skewed Random k-SAT

      • Danila A. Sinopalnikov
      Pages 263-275

    3. NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances

      • Sathiamoorthy Subbarayan, Dhiraj K. Pradhan
      Pages 276-291

    4. Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems

      • Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik
      Pages 292-305

    5. UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT

      • Dave A. D. Tompkins, Holger H. Hoos
      Pages 306-320

  2. SAT Solver Competition and QBF Solver Evaluation (Invited Papers)

    1. Fifty-Five Solvers in Vancouver: The SAT 2004 Competition

      • Daniel Le Berre, Laurent Simon
      Pages 321-344

    2. March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver

      • Marijn Heule, Mark Dufour, Joris van Zwieten, Hans van Maaren
      Pages 345-359

    3. Zchaff2004: An Efficient SAT Solver

      • Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik
      Pages 360-375

    4. The Second QBF Solvers Comparative Evaluation

      • Daniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella
      Pages 376-392

  3. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing

Keywords

Editors and Affiliations

  • Department of Computer Science, University of British Columbia Vancouver, Canada

    Holger H. Hoos

  • Computational Logic Laboratory, Simon Fraser University, Burnaby, Canada

    David G. Mitchell

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation