Skip to main content
Springer Nature Link
Account

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

  2. David G. Mitchell

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

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

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (28 papers)

  1. Front Matter

    Download chapter PDF

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

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

      • Carlos Ansótegui, Felip Manyà
      Pages 1-15

    2. A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints

      • Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea
      Pages 16-29

    3. An Algebraic Approach to the Complexity of Generalized Conjunctive Queries

      • Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
      Pages 30-45

    4. Incremental Compilation-to-SAT Procedures

      • Marco Benedetti, Sara Bernardini
      Pages 46-58

    5. Resolve and Expand

      • Armin Biere
      Pages 59-70

    6. Looking Algebraically at Tractable Quantified Boolean Formulas

      • Hubie Chen, Víctor Dalmau
      Pages 71-79

    7. Derandomization of Schuler’s Algorithm for SAT

      • Evgeny Dantsin, Alexander Wolpert
      Pages 80-88

    8. Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank

      • Nicola Galesi, Oliver Kullmann
      Pages 89-104

    9. QBF Reasoning on Real-World Instances

      • Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella
      Pages 105-121

    10. Automatic Extraction of Functional Dependencies

      • Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Saïs
      Pages 122-132

    11. Algorithms for Satisfiability Using Independent Sets of Variables

      • Ravi Gummadi, N. S. Narayanaswamy, R. Venkatakrishnan
      Pages 133-144

    12. Aligning CNF- and Equivalence-Reasoning

      • Marijn Heule, Hans van Maaren
      Pages 145-156

    13. Using DPLL for Efficient OBDD Construction

      • Jinbo Huang, Adnan Darwiche
      Pages 157-172

    14. Approximation Algorithm for Random MAX-kSAT

      • Yannet Interian
      Pages 173-182

    15. Clause Form Conversions for Boolean Circuits

      • Paul Jackson, Daniel Sheridan
      Pages 183-198

    16. From Spin Glasses to Hard Satisfiable Formulas

      • Haixia Jia, Cris Moore, Bart Selman
      Pages 199-210

    17. CirCUs: A Hybrid Satisfiability Solver

      • HoonSang Jin, Fabio Somenzi
      Pages 211-223

    18. Equivalence Models for Quantified Boolean Formulas

      • Hans Kleine Büning, Xishun Zhao
      Pages 224-234

    19. Search vs. Symbolic Techniques in Satisfiability Solving

      • Guoqiang Pan, Moshe Y. Vardi
      Pages 235-250
Back to top

Other volumes

  1. Theory and Applications of Satisfiability Testing

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

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top