| 2004 | A Comparative Study of 2QBF Algorithms. Darsh Ranjan, Daijue Tang, Sharad Malik |
| 2004 | A Note on Satisfying Truth-Value Assignments of Boolean Formulas. Zbigniew Stachniak |
| 2004 | A Random Constraint Satisfaction Problem That Seems Hard for DPLL. Harold S. Connamacher |
| 2004 | A SAT Based Scheduler for Tournament Schedules. Hantao Zhang, Dapeng Li, Haiou Shen |
| 2004 | A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints. Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea |
| 2004 | Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers. Renato Bruni, Andrea Santori |
| 2004 | Algorithms for Satisfiability using Independent Sets of Variables. Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy |
| 2004 | Aligning CNF- and Equivalence-reasoning. Marijn Heule, Hans van Maaren |
| 2004 | An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer |
| 2004 | Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems. Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik |
| 2004 | Approximation Algorithm for Random MAX-kSAT. Yannet Interian |
| 2004 | Automatic Extraction of Functional Dependencies. Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais |
| 2004 | Boolean Ring Satisfiability. Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, Daher Kaiss |
| 2004 | CirCUs: A Hybrid Satisfiability Solver. HoonSang Jin, Fabio Somenzi |
| 2004 | Combining Component Caching and Clause Learning for Effective Model Counting. Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, Toniann Pitassi |
| 2004 | Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. Shlomo Hoory, Stefan Szeider |
| 2004 | Dealing with Symmetries in Quantified Boolean Formulas. Gilles Audemard, Bertrand Mazure, Lakhdar Sais |
| 2004 | Derandomization of Schuler's Algorithm for SAT. Evgeny Dantsin, Alexander Wolpert |
| 2004 | Detecting Backdoor Sets with Respect to Horn and Binary Clauses. Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
| 2004 | Early Conflict Detection Based BCP for SAT Solving. Matthew D. T. Lewis, Tobias Schubert, Bernd Becker |
| 2004 | Efficient Implementations of SAT Local Search. Alex S. Fukunaga |
| 2004 | Encoding Global Unobservability for Efficient Translation to SAT. Miroslav N. Velev |
| 2004 | Equivalence Models for Quantified Boolean Formulas. Hans Kleine Büning, Xishun Zhao |
| 2004 | From Spin Glasses to Hard Satisfiable Formulas. Haixia Jia, Cristopher Moore, Bart Selman |
| 2004 | Full CNF Encoding: The Counting Constraints Case. Olivier Bailleux, Yacine Boufkhad |
| 2004 | Game-SAT: A Preliminary Report. Ling Zhao, Martin Müller |
| 2004 | Improving First-order Model Searching by Propositional Reasoning and Lemma Learning. Zhuo Huang, Hantao Zhang, Jian Zhang |
| 2004 | Incremental Compilation-to-SAT Procedures. Marco Benedetti, Sara Bernardini |
| 2004 | Local Search for Very Large SAT Problems. Steven D. Prestwich, Colin Quirke |
| 2004 | Local Search with Bootstrapping. Lengning Liu, Miroslaw Truszczynski |
| 2004 | Looking Algebraically at Tractable Quantified Boolean Formulas. Hubie Chen, Víctor Dalmau |
| 2004 | Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. Carlos Ansótegui, Felip Manyà |
| 2004 | NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances. Sathiamoorthy Subbarayan, Dhiraj K. Pradhan |
| 2004 | On Computing Minimum Unsatisfiable Cores. Inês Lynce, João Marques-Silva |
| 2004 | Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. Nicola Galesi, Oliver Kullmann |
| 2004 | QBF Reasoning on Real-World Instances. Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella |
| 2004 | Resolve and Expand. Armin Biere |
| 2004 | SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings |
| 2004 | Satisfiability Threshold of the Skewed Random k-SAT. Danila A. Sinopalnikov |
| 2004 | Search vs. Symbolic Techniques in Satisfiability Solving. Guoqiang Pan, Moshe Y. Vardi |
| 2004 | Solving Non-clausal Formulas with DPLL search. Christian Thiffault, Fahiem Bacchus, Toby Walsh |
| 2004 | The Optimality of a Fast CNF Conversion and its Use with SAT. Daniel Sheridan |
| 2004 | UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT. Dave A. D. Tompkins, Holger H. Hoos |
| 2004 | Using DPLL for Efficient OBDD Construction. Jinbo Huang, Adnan Darwiche |
| 2004 | Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization. Vasco M. Manquinho, João Marques-Silva |
| 2004 | Using Rewarding Mechanisms for Improving Branching Heuristics. Elsa Carvalho, João Marques-Silva |
| 2004 | Verifying the On-Line Help System of SIEMENS Magnetic Resonance Tomographs using SAT (Extended Abstract) Carsten Sinz, Wolfgang Küchlin |
| 2004 | Visualizing the Internal Structure of SAT Instances (Preliminary Report) Carsten Sinz |
| 2004 | Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems. Stefan Porschen, Ewald Speckenmeyer |