default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th SAT 2007: Lisbon, Portugal
- João Marques-Silva, Karem A. Sakallah:
Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings. Lecture Notes in Computer Science 4501, Springer 2007, ISBN 978-3-540-72787-3 - Martin Davis:
SAT: Past and Future. 1-2 - Juan Antonio Navarro Pérez, Andrei Voronkov:
Encodings of Problems in Effectively Propositional Logic. 3 - Panagiotis Manolios
, Daron Vroon:
Efficient Circuit to CNF Conversion. 4-9 - Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Mapping CSP into Many-Valued SAT. 10-15 - Gilles Audemard, Lakhdar Sais:
Circuit Based Encoding of CNF Formula. 16-21 - Inês Lynce, João Marques-Silva:
Breaking Symmetries in SAT Matrix Models. 22-27 - Josep Argelich, Felip Manyà:
Partial Max-SAT Solvers with Clause Learning. 28-40 - Federico Heras, Javier Larrosa, Albert Oliveras:
MiniMaxSat: A New Weighted Max-SAT Solver. 41-55 - Martin Lukasiewycz, Michael Glaß, Christian Haubelt, Jürgen Teich:
Solving Multi-objective Pseudo-Boolean Problems. 56-69 - Arist Kojevnikov:
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities. 70-79 - Marina Langlois, Robert H. Sloan, György Turán:
Horn Upper Bounds and Renaming. 80-93 - Stefan Szeider:
Matched Formulas and Backdoor Sets. 94-99 - Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman:
Short XORs for Model Counting: From Theory to Practice. 100-106 - Steven D. Prestwich:
Variable Dependency in Local Search: Prevention Is Better Than Cure. 107-120 - Chu Min Li, Wanxia Wei, Harry Zhang:
Combining Adaptive Noise and Look-Ahead in Local Search for SAT. 121-133 - Marijn Heule, Hans van Maaren:
From Idempotent Generalized Boolean Assignments to Multi-bit Search. 134-147 - Dominik Scheder, Philipp Zumstein:
Satisfiability with Exponential Families. 148-158 - Alexander Hertel, Philipp Hertel, Alasdair Urquhart:
Formalizing Dangerous SAT Encodings. 159-172 - Stefan Porschen, Ewald Speckenmeyer:
Algorithms for Variable-Weighted 2-SAT and Dual Problems. 173-186 - Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto:
On the Boolean Connectivity Problem for Horn Relations. 187-200 - Toni Jussila, Armin Biere, Carsten Sinz, Daniel Kröning, Christoph M. Wintersteiger:
A First Step Towards a Unified Proof Checker for QBF. 201-214 - Horst Samulowitz, Fahiem Bacchus:
Dynamically Partitioning for Solving QBF. 215-229 - Marko Samer, Stefan Szeider:
Backdoor Sets of Quantified Boolean Formulas. 230-243 - Uwe Bubeck, Hans Kleine Büning:
Bounded Universal Expansion for Preprocessing QBF. 244-257 - Marijn Heule, Hans van Maaren:
Effective Incorporation of Double Look-Ahead Procedures. 258-271 - Niklas Eén, Alan Mishchenko, Niklas Sörensson:
Applying Logic Synthesis for Speeding Up SAT. 272-286 - Nachum Dershowitz, Ziyad Hanna, Alexander Nadel:
Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver. 287-293 - Knot Pipatsrisawat, Adnan Darwiche:
A Lightweight Component Caching Scheme for Satisfiability Solvers. 294-299 - Joshua Buresh-Oppenheim, David G. Mitchell:
Minimum 2CNF Resolution Refutations in Polynomial Time. 300-313 - Oliver Kullmann:
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. 314-327 - Allen Van Gelder:
Verifying Propositional Unsatisfiability: Pitfalls to Avoid. 328-333 - Alessandro Cimatti, Alberto Griggio, Roberto Sebastiani:
A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories. 334-339 - Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl:
SAT Solving for Termination Analysis with Polynomial Interpretations. 340-354 - Stefan Staber, Roderick Bloem:
Fault Localization and Correction with QBF. 355-368 - Fadi A. Aloul, Nagarajan Kandasamy:
Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach. 369-376 - Debapratim De, Abishek Kumarasubramanian, Ramarathnam Venkatesan:
Inversion Attacks on Secure Hash Functions Using satSolvers. 377-382
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-08 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
