default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th SAT 2004: Vancouver, BC, Canada
- Holger H. Hoos, David G. Mitchell:
Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3542, Springer 2005, ISBN 3-540-27829-X - Carlos Ansótegui, Felip Manyà:
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. 1-15 - Alessandro Armando, Claudio Castellini
, Enrico Giunchiglia, Marco Maratea:
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints. 16-29 - Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. 30-45 - Marco Benedetti, Sara Bernardini:
Incremental Compilation-to-SAT Procedures. 46-58 - Armin Biere:
Resolve and Expand. 59-70 - Hubie Chen, Víctor Dalmau:
Looking Algebraically at Tractable Quantified Boolean Formulas. 71-79 - Evgeny Dantsin, Alexander Wolpert:
Derandomization of Schuler's Algorithm for SAT. 80-88 - Nicola Galesi, Oliver Kullmann:
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. 89-104 - Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
QBF Reasoning on Real-World Instances. 105-121 - Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais:
Automatic Extraction of Functional Dependencies. 122-132 - Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy:
Algorithms for Satisfiability Using Independent Sets of Variables. 133-144 - Marijn Heule, Hans van Maaren:
Aligning CNF- and Equivalence-Reasoning. 145-156 - Jinbo Huang, Adnan Darwiche:
Using DPLL for Efficient OBDD Construction. 157-172 - Yannet Interian:
Approximation Algorithm for Random MAX- kSAT. 173-182 - Paul B. Jackson, Daniel Sheridan:
Clause Form Conversions for Boolean Circuits. 183-198 - Haixia Jia, Cristopher Moore, Bart Selman:
From Spin Glasses to Hard Satisfiable Formulas. 199-210 - HoonSang Jin, Fabio Somenzi:
CirCUs: A Hybrid Satisfiability Solver. 211-223 - Hans Kleine Büning, Xishun Zhao:
Equivalence Models for Quantified Boolean Formulas. 224-234 - Guoqiang Pan, Moshe Y. Vardi:
Search vs. Symbolic Techniques in Satisfiability Solving. 235-250 - Stefan Porschen, Ewald Speckenmeyer:
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. 251-262 - Danila A. Sinopalnikov:
Satisfiability Threshold of the Skewed Random k-SAT. 263-275 - Sathiamoorthy Subbarayan, Dhiraj K. Pradhan:
NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances. 276-291 - Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik:
Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems. 292-305 - Dave A. D. Tompkins, Holger H. Hoos:
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT. 306-320
2004 SAT Solver Competition and QBF Solver Evaluation (Invited Papers)
- Daniel Le Berre, Laurent Simon:
Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. 321-344 - Marijn Heule, Mark Dufour, Joris E. van Zwieten, Hans van Maaren:
March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver. 345-359 - Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik:
Zchaff2004: An Efficient SAT Solver. 360-375 - Daniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella:
The Second QBF Solvers Comparative Evaluation. 376-392
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-22 00:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
