Conferences in DBLP
Hossein M. Sheini , Karem A. Sakallah From Propositional Satisfiability to Satisfiability Modulo Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Fahiem Bacchus CSPs: Adding Structure to SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Arist Kojevnikov , Alexander S. Kulikov Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. [Citation Graph (0, 0)][DBLP ] Conf ] Oliver Kullmann , Inês Lynce , João Marques-Silva Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel. [Citation Graph (0, 0)][DBLP ] Conf ] Nachum Dershowitz , Ziyad Hanna , Alexander Nadel A Scalable Algorithm for Minimal Unsatisfiable Core Extraction. [Citation Graph (0, 0)][DBLP ] Conf ] Joshua Buresh-Oppenheim , David G. Mitchell Minimum Witnesses for Unsatisfiable 2CNFs. [Citation Graph (0, 0)][DBLP ] Conf ] Allen Van Gelder Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Toni Jussila , Carsten Sinz , Armin Biere Extended Resolution Proofs for Symbolic SAT Solving with Quantification. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Chavira , Adnan Darwiche Encoding CNFs to Empower Component Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Himanshu Jain , Constantinos Bartzis , Edmund M. Clarke Satisfiability Checking of Non-clausal Formulas Using General Matings. [Citation Graph (0, 0)][DBLP ] Conf ] Eugene Goldberg Determinization of Resolution by an Algorithm Operating on Complete Assignments. [Citation Graph (0, 0)][DBLP ] Conf ] Hantao Zhang A Complete Random Jump Strategy with Guiding Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Ilya Mironov , Lintao Zhang Applications of SAT Solvers to Cryptanalysis of Hash Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Yuliya Zabiyaka , Adnan Darwiche Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Sebastiani , Michele Vescovi Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALC. [Citation Graph (0, 0)][DBLP ] Conf ] Inês Lynce , João Marques-Silva SAT in Bioinformatics: Making the Case with Haplotype Inference. [Citation Graph (0, 0)][DBLP ] Conf ] Yinlei Yu , Sharad Malik Lemma Learning in SMT on Linear Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Nieuwenhuis , Albert Oliveras On SAT Modulo Theories and Optimization Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Scott Cotton , Oded Maler Fast and Flexible Difference Constraint Propagation for DPLL(T). [Citation Graph (0, 0)][DBLP ] Conf ] Hossein M. Sheini , Karem A. Sakallah A Progressive Simplifier for Satisfiability Modulo Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Bubeck , Hans Kleine Büning Dependency Quantified Horn Formulas: Models and Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Porschen , Ewald Speckenmeyer , Bert Randerath On Linear CNF Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Su Chen , Tomasz Imielinski , Karin Johnsgard , Donald Smith , Mario Szegedy A Dichotomy Theorem for Typed Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Maria Luisa Bonet , Jordi Levy , Felip Manyà A Complete Calculus for Max-SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Zhaohui Fu , Sharad Malik On Solving the Partial MAX-SAT Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Evgeny Dantsin , Alexander Wolpert MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2 ) Time. [Citation Graph (0, 0)][DBLP ] Conf ] Osamu Watanabe , Masaki Yamamoto Average-Case Analysis for the MAX-2SAT Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Steven David Prestwich , Inês Lynce Local Search for Unsatisfiability. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei A. Bulatov , Evgeny S. Skvortsov Efficiency of Local Search. [Citation Graph (0, 0)][DBLP ] Conf ] Panagiotis Manolios , Yimin Zhang Implementing Survey Propagation on Graphics Processing Units. [Citation Graph (0, 0)][DBLP ] Conf ] Eric I. Hsu , Sheila A. McIlraith Characterizing Propagation Methods for Boolean Satisfiability. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Kleine Büning , Xishun Zhao Minimal False Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Horst Samulowitz , Fahiem Bacchus Binary Clause Reasoning in QBF. [Citation Graph (0, 0)][DBLP ] Conf ] Daijue Tang , Sharad Malik Solving Quantified Boolean Formulas with Circuit Observability Don't Cares. [Citation Graph (0, 0)][DBLP ] Conf ] Ashish Sabharwal , Carlos Ansótegui , Carla P. Gomes , Justin W. Hart , Bart Selman QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. [Citation Graph (0, 0)][DBLP ] Conf ] Naomi Nishimura , Prabhakar Ragde , Stefan Szeider Solving #SAT Using Vertex Covers. [Citation Graph (0, 0)][DBLP ] Conf ] António Morgado , Paulo J. Matos , Vasco M. Manquinho , João P. Marques Silva Counting Models in Integer Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Thurley sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP. [Citation Graph (0, 0)][DBLP ] Conf ] Antti Eero Johannes Hyvärinen , Tommi A. Junttila , Ilkka Niemelä A Distribution Method for Solving SAT in Grids. [Citation Graph (0, 0)][DBLP ] Conf ] 