Table of Contents

• QBF Reasoning on Real-World InstancesEnrico Giunchiglia, Massimo Narizzano, Armando Tacchella. [doi]
• Encoding Global Unobservability for Efficient Translation to SATMiroslav N. Velev. [doi]
• Mapping Problems with Finite-Domain Variables into Problems with Boolean VariablesCarlos Ansótegui, Felip Manyà. [doi]
• Detecting Backdoor Sets with Respect to Horn and Binary ClausesNaomi Nishimura, Prabhakar Ragde, Stefan Szeider. [doi]
• Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian RankNicola Galesi, Oliver Kullmann. [doi]
• A Comparative Study of 2QBF AlgorithmsDarsh P. Ranjan, Daijue Tang, Sharad Malik. [doi]
• Full CNF Encoding: The Counting Constraints CaseOlivier Bailleux, Yacine Boufkhad. [doi]
• CirCUs: A Hybrid Satisfiability SolverHoonSang Jin, Fabio Somenzi. [doi]
• NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instancesSathiamoorthy Subbarayan, Dhiraj K. Pradhan. [doi]
• Verifying the On-Line Help System of SIEMENS Magnetic Resonance Tomographs using SAT (Extended Abstract)Carsten Sinz, Wolfgang Küchlin. [doi]
• Algorithms for Satisfiability using Independent Sets of VariablesRavi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy. [doi]
• Using Rewarding Mechanisms for Improving Branching HeuristicsElsa Carvalho, João P. Marques Silva. [doi]
• Early Conflict Detection Based BCP for SAT SolvingMatthew D. T. Lewis, Tobias Schubert, Bernd Becker. [doi]
• Looking Algebraically at Tractable Quantified Boolean FormulasHubie Chen, Víctor Dalmau. [doi]
• Search vs. Symbolic Techniques in Satisfiability SolvingGuoqiang Pan, Moshe Y. Vardi. [doi]
• Equivalence Models for Quantified Boolean FormulasHans Kleine Büning, Xishun Zhao. [doi]
• UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SATDave A. D. Tompkins, Holger H. Hoos. [doi]
• Improving First-order Model Searching by Propositional Reasoning and Lemma LearningZhuo Huang, Hantao Zhang, Jian Zhang. [doi]
• The Optimality of a Fast CNF Conversion and its Use with SATDaniel Sheridan. [doi]
• Dealing with Symmetries in Quantified Boolean FormulasGilles Audemard, Bertrand Mazure, Lakhdar Sais. [doi]
• An Algebraic Approach to the Complexity of Generalized Conjunctive QueriesMichael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer. [doi]
• Derandomization of Schuler s Algorithm for SATEvgeny Dantsin, Alexander Wolpert. [doi]
• Using DPLL for Efficient OBDD ConstructionJinbo Huang, Adnan Darwiche. [doi]
• Visualizing the Internal Structure of SAT Instances (Preliminary Report)Carsten Sinz. [doi]
• Incremental Compilation-to-SAT ProceduresMarco Benedetti, Sara Bernardini. [doi]
• Automatic Extraction of Functional DependenciesÉric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais. [doi]
• Solving Non-clausal Formulas with DPLL searchChristian Thiffault, Fahiem Bacchus, Toby Walsh. [doi]
• Game-SAT: A Preliminary ReportLing Zhao, Martin Müller 0003. [doi]
• Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter ProblemsDaijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik. [doi]
• Aligning CNF- and Equivalence-reasoningMarijn Heule, Hans van Maaren. [doi]
• A Note on Satisfying Truth-Value Assignments of Boolean FormulasZbigniew Stachniak. [doi]
• A SAT Based Scheduler for Tournament SchedulesHantao Zhang, Dapeng Li, Haiou Shen. [doi]
• Worst Case Bounds for some NP-Complete Modified Horn-SAT ProblemsStefan Porschen, Ewald Speckenmeyer. [doi]
• Boolean Ring SatisfiabilityNachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, Daher Kaiss. [doi]
• Computing Unsatisfiable k-SAT Instances with Few Occurrences per VariableShlomo Hoory, Stefan Szeider. [doi]
• Satisfiability Threshold of the Skewed Random k-SATDanila A. Sinopalnikov. [doi]
• Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT SolversRenato Bruni, Andrea Santori. [doi]
• On Computing Minimum Unsatisfiable CoresInês Lynce, João P. Marques Silva. [doi]
• Local Search with BootstrappingLengning Liu, Miroslaw Truszczynski. [doi]
• A SAT-based Decision Procedure for the Boolean Combination of Difference ConstraintsAlessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea. [doi]
• From Spin Glasses to Hard Satisfiable FormulasHaixia Jia, Cristopher Moore, Bart Selman. [doi]
• Resolve and ExpandArmin Biere. [doi]
• Approximation Algorithm for Random MAX-kSATYannet Interian. [doi]
• Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean OptimizationVasco M. Manquinho, João P. Marques Silva. [doi]
• Combining Component Caching and Clause Learning for Effective Model CountingTian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, Toniann Pitassi. [doi]
• A Random Constraint Satisfaction Problem That Seems Hard for DPLLHarold S. Connamacher. [doi]
• Local Search for Very Large SAT ProblemsSteven David Prestwich, Colin Quirke. [doi]
• Efficient Implementations of SAT Local SearchAlex S. Fukunaga. [doi]