Conferences in DBLP
Martin Davis SAT: Past and Future. [Citation Graph (0, 0)][DBLP ] Conf ] Juan Antonio Navarro Pérez , Andrei Voronkov Encodings of Problems in Effectively Propositional Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Panagiotis Manolios , Daron Vroon Efficient Circuit to CNF Conversion. [Citation Graph (0, 0)][DBLP ] Conf ] Carlos Ansótegui , Maria Luisa Bonet , Jordi Levy , Felip Manyà Mapping CSP into Many-Valued SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Audemard , Lakhdar Sais Circuit Based Encoding of CNF Formula. [Citation Graph (0, 0)][DBLP ] Conf ] Inês Lynce , João P. Marques Silva Breaking Symmetries in SAT Matrix Models. [Citation Graph (0, 0)][DBLP ] Conf ] Josep Argelich , Felip Manyà Partial Max-SAT Solvers with Clause Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Federico Heras , Javier Larrosa , Albert Oliveras MiniMaxSat: A New Weighted Max-SAT Solver. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Lukasiewycz , Michael Glaß , Christian Haubelt , Jürgen Teich Solving Multi-objective Pseudo-Boolean Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Arist Kojevnikov Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities. [Citation Graph (0, 0)][DBLP ] Conf ] Marina Langlois , Robert H. Sloan , György Turán Horn Upper Bounds and Renaming. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Szeider Matched Formulas and Backdoor Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Carla P. Gomes , Jörg Hoffmann , Ashish Sabharwal , Bart Selman Short XORs for Model Counting: From Theory to Practice. [Citation Graph (0, 0)][DBLP ] Conf ] Steven David Prestwich Variable Dependency in Local Search: Prevention Is Better Than Cure. [Citation Graph (0, 0)][DBLP ] Conf ] Chu Min Li , Wanxia Wei , Harry Zhang Combining Adaptive Noise and Look-Ahead in Local Search for SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Marijn Heule , Hans van Maaren From Idempotent Generalized Boolean Assignments to Multi-bit Search. [Citation Graph (0, 0)][DBLP ] Conf ] Dominik Scheder , Philipp Zumstein Satisfiability with Exponential Families. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Hertel , Philipp Hertel , Alasdair Urquhart Formalizing Dangerous SAT Encodings. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Porschen , Ewald Speckenmeyer Algorithms for Variable-Weighted 2-SAT and Dual Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuhisa Makino , Suguru Tamaki , Masaki Yamamoto On the Boolean Connectivity Problem for Horn Relations. [Citation Graph (0, 0)][DBLP ] Conf ] Toni Jussila , Armin Biere , Carsten Sinz , Daniel Kröning , Christoph M. Wintersteiger A First Step Towards a Unified Proof Checker for QBF. [Citation Graph (0, 0)][DBLP ] Conf ] Horst Samulowitz , Fahiem Bacchus Dynamically Partitioning for Solving QBF. [Citation Graph (0, 0)][DBLP ] Conf ] Marko Samer , Stefan Szeider Backdoor Sets of Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Bubeck , Hans Kleine Büning Bounded Universal Expansion for Preprocessing QBF. [Citation Graph (0, 0)][DBLP ] Conf ] Marijn Heule , Hans van Maaren Effective Incorporation of Double Look-Ahead Procedures. [Citation Graph (0, 0)][DBLP ] Conf ] Niklas Eén , Alan Mishchenko , Niklas Sörensson Applying Logic Synthesis for Speeding Up SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Nachum Dershowitz , Ziyad Hanna , Alexander Nadel Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver. [Citation Graph (0, 0)][DBLP ] Conf ] Knot Pipatsrisawat , Adnan Darwiche A Lightweight Component Caching Scheme for Satisfiability Solvers. [Citation Graph (0, 0)][DBLP ] Conf ] Joshua Buresh-Oppenheim , David G. Mitchell Minimum 2CNF Resolution Refutations in Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] Oliver Kullmann Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Allen Van Gelder Verifying Propositional Unsatisfiability: Pitfalls to Avoid. [Citation Graph (0, 0)][DBLP ] Conf ] Alessandro Cimatti , Alberto Griggio , Roberto Sebastiani A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Fuhs , Jürgen Giesl , Aart Middeldorp , Peter Schneider-Kamp , René Thiemann , Harald Zankl SAT Solving for Termination Analysis with Polynomial Interpretations. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Staber , Roderick Bloem Fault Localization and Correction with QBF. [Citation Graph (0, 0)][DBLP ] Conf ] Fadi A. Aloul , Nagaragan Kandasamy Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Debapratim De , Abishek Kumarasubramanian , Ramarathnam Venkatesan Inversion Attacks on Secure Hash Functions Using satSolvers. [Citation Graph (0, 0)][DBLP ] Conf ] 