Conferences in DBLP
Carlos Ansótegui , Felip Manyà Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. [Citation Graph (0, 0)][DBLP ] Conf ] Alessandro Armando , Claudio Castellini , Enrico Giunchiglia , Marco Maratea A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Bauland , Philippe Chapdelaine , Nadia Creignou , Miki Hermann , Heribert Vollmer An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Benedetti , Sara Bernardini Incremental Compilation-to-SAT Procedures. [Citation Graph (0, 0)][DBLP ] Conf ] Armin Biere Resolve and Expand. [Citation Graph (0, 0)][DBLP ] Conf ] Hubie Chen , Víctor Dalmau Looking Algebraically at Tractable Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Evgeny Dantsin , Alexander Wolpert Derandomization of Schuler's Algorithm for SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Nicola Galesi , Oliver Kullmann Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. [Citation Graph (0, 0)][DBLP ] Conf ] Enrico Giunchiglia , Massimo Narizzano , Armando Tacchella QBF Reasoning on Real-World Instances. [Citation Graph (0, 0)][DBLP ] Conf ] Éric Grégoire , Richard Ostrowski , Bertrand Mazure , Lakhdar Sais Automatic Extraction of Functional Dependencies. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Gummadi , N. S. Narayanaswamy , Venkatakrishnan Ramaswamy Algorithms for Satisfiability Using Independent Sets of Variables. [Citation Graph (0, 0)][DBLP ] Conf ] Marijn Heule , Hans van Maaren Aligning CNF- and Equivalence-Reasoning. [Citation Graph (0, 0)][DBLP ] Conf ] Jinbo Huang , Adnan Darwiche Using DPLL for Efficient OBDD Construction. [Citation Graph (0, 0)][DBLP ] Conf ] Yannet Interian Approximation Algorithm for Random MAX- k SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Jackson , Daniel Sheridan Clause Form Conversions for Boolean Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Haixia Jia , Cristopher Moore , Bart Selman From Spin Glasses to Hard Satisfiable Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] HoonSang Jin , Fabio Somenzi CirCUs: A Hybrid Satisfiability Solver. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Kleine Büning , Xishun Zhao Equivalence Models for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Guoqiang Pan , Moshe Y. Vardi Search vs. Symbolic Techniques in Satisfiability Solving. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Porschen , Ewald Speckenmeyer Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Danila A. Sinopalnikov Satisfiability Threshold of the Skewed Random k -SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Sathiamoorthy Subbarayan , Dhiraj K. Pradhan NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances. [Citation Graph (0, 0)][DBLP ] Conf ] 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. [Citation Graph (0, 0)][DBLP ] Conf ] Dave A. D. Tompkins , Holger H. Hoos UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Le Berre , Laurent Simon Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. [Citation Graph (0, 0)][DBLP ] Conf ] Marijn Heule , Mark Dufour , Joris van Zwieten , Hans van Maaren March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver. [Citation Graph (0, 0)][DBLP ] Conf ] Yogesh S. Mahajan , Zhaohui Fu , Sharad Malik Zchaff2004: An Efficient SAT Solver. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Le Berre , Massimo Narizzano , Laurent Simon , Armando Tacchella The Second QBF Solvers Comparative Evaluation. [Citation Graph (0, 0)][DBLP ] Conf ] 