SAT A

37 papers

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