Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th SAT 2005: St. Andrews, UK
- Fahiem Bacchus, Toby Walsh:
Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings. Lecture Notes in Computer Science 3569, Springer 2005, ISBN 3-540-26276-8 - Josep Argelich, Felip Manyà:
Solving Over-Constrained Problems with SAT Technology. 1-15 - Gilles Audemard, Lakhdar Sais:
A Symbolic Search Based Approach for Quantified Boolean Formulas. 16-30 - Anton Belov, Zbigniew Stachniak:
Substitutional Definition of Satisfiability in Classical Propositional Logic. 31-45 - Nachum Dershowitz, Ziyad Hanna, Alexander Nadel:
A Clause-Based Heuristic for SAT Solvers. 46-60 - Niklas Eén, Armin Biere:
Effective Preprocessing in SAT Through Variable and Clause Elimination. 61-75 - Nicola Galesi, Neil Thapen:
Resolution and Pebbling Games. 76-90 - Ian P. Gent, Andrew G. D. Rowley:
Local and Global Complete Solution Learning Methods for QBF. 91-106 - Eugene Goldberg:
Equivalence Checking of Circuits with Parameterized Specifications. 107-121 - Marijn Heule, Hans van Maaren:
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming. 122-134 - Edward A. Hirsch, Sergey I. Nikolenko:
Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution. 135-142 - Michal Kouril, John V. Franco:
Resolution Tunnels for Improved SAT Solver Performance. 143-157 - Chu Min Li, Wenqi Huang:
Diversification and Determinism in Local Search for Satisfiability. 158-172 - Mark H. Liffiton, Karem A. Sakallah:
On Finding All Minimally Unsatisfiable Subformulas. 173-186 - Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, Lintao Zhang, Martin C. Rinard:
Optimizations for Compiling Declarative Models into Boolean Formulas. 187-202 - Steven D. Prestwich:
Random Walk with Continuously Smoothed Variable Weights. 203-215 - Daniel Rolf:
Derandomization of PPSZ for Unique- k-SAT. 216-225 - Tian Sang, Paul Beame
, Henry A. Kautz:
Heuristics for Fast Exact Model Counting. 226-240 - Hossein M. Sheini, Karem A. Sakallah:
A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic. 241-256 - Carsten Sinz, Edda-Maria Dieringer:
DPvis - A Tool to Visualize the Structure of SAT Instances. 257-268 - Finnegan Southey:
Constraint Metrics for Local Search. 269-281 - Allen Van Gelder:
Input Distance and Lower Bounds for Propositional Resolution Proof Length. 282-293 - Hans van Maaren, Linda van Norden:
Sums of Squares, Satisfiability and Maximum Satisfiability. 294-308 - Magnus Wahlström:
Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable. 309-323 - Wei Wei, Bart Selman:
A New Approach to Model Counting. 324-339 - Emmanuel Zarpas:
Benchmarking SAT Solvers for Bounded Model Checking. 340-354 - Xishun Zhao, Hans Kleine Büning:
Model-Equivalent Reductions. 355-370 - Teresa Alsinet, Felip Manyà, Jordi Planes:
Improved Exact Solvers for Weighted Max-SAT. 371-377 - Marco Benedetti:
Quantifier Trees for QBFs. 378-385 - Uwe Bubeck, Hans Kleine Büning, Xishun Zhao:
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. 386-392 - Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe:
A Branching Heuristics for Quantified Renamable Horn Formulas. 393-399 - Evgeny Dantsin, Alexander Wolpert:
An Improved Upper Bound for SAT. 400-407 - Nachum Dershowitz, Ziyad Hanna, Jacob Katz:
Bounded Model Checking with QBF. 408-414 - Vijay Durairaj, Priyank Kalla:
Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies. 415-422 - Roman Gershman, Ofer Strichman:
Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas. 423-429 - Alexander S. Kulikov:
Automated Generation of Simplification Rules for SAT and MAXSAT. 430-436 - Matthew D. T. Lewis, Tobias Schubert, Bernd Becker:
Speedup Techniques Utilized in Modern SAT Solvers. 437-443 - Andrew C. Ling, Deshanand P. Singh, Stephen Dean Brown:
FPGA Logic Synthesis Using Quantified Boolean Satisfiability. 444-450 - Vasco M. Manquinho, João Marques-Silva:
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization. 451-458 - Andreas Meier, Volker Sorge:
A New Set of Algebraic Benchmark Problems for SAT Solvers. 459-466 - Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João Marques-Silva, Karem A. Sakallah:
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas. 467-474 - Sakari Seitz, Mikko Alava, Pekka Orponen:
Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability. 475-481 - Lintao Zhang:
On Subsumption Removal and On-the-Fly CNF Simplification. 482-489
a service of 
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 2024-04-18 20:18 CEST 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:
