default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 9
Volume 9, June 2001
- Henry A. Kautz
, Bart Selman:
Preface: Volume 9. 1 - Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel:
Balance and Filtering in Structured Satisfiable Problems (Preliminary Report). 2-18 - Ilya Shlyakhter:
Generating effective symmetry-breaking predicates for search problems. 19-35 - Simona Cocco, Rémi Monasson:
Statistical physics analysis of the backtrack resolution of random 3-SAT instances. 36-47 - Hans Kleine Büning, Xishun Zhao:
Satisfiable Formulas Closed Under Replacement. 48-58 - Daniel Le Berre:
Exploiting the real power of unit propagation lookahead. 59-80 - Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
The unsatisfiability threshold revisited. 81-95 - Eugene Goldberg:
Proving unsatisfiability of CNFs locally. 96-114 - Allen Van Gelder:
Combining Preorder and Postorder Resolution in a Satisfiability Solver. 115-128 - Laurent Simon, Philippe Chatalic:
SatEx: A Web-based Framework for SAT Experimentation. 129-149 - Andrea Roll:
Criticality and Parallelism in GSAT. 150-161 - Renato Bruni, Antonio Sassano:
Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae. 162-173 - Bernard Jurkowiak, Chu Min Li, Gil Utard:
Parallelizing Satz Using Dynamic Workload Balancing. 174-189 - Inês Lynce, Luís Baptista, João Marques-Silva:
Stochastic Systematic Search Algorithms for Satisfiability. 190-204 - Carsten Sinz, Wolfgang Blochinger, Wolfgang Küchlin:
PaSAT - Parallel SAT-Checking with Lemma Exchange: Implementation and Applications. 205-216 - Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns:
Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems. 217-230 - Oliver Kullmann:
On the use of autarkies for satisfiability decision. 231-253 - Tom Morrisette:
The Unreasonable Effectiveness of Alternation-Based Satisfiability Algorithms. 254-268 - Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek:
A Satisfiability Formulation of Problems on Level Graphs. 269-277 - Breanndán Ó Nualláin, Maarten de Rijke, Johan van Benthem:
Ensemble-based prediction of SAT search behaviour. 278-289 - Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella, Moshe Y. Vardi:
Towards an Efficient Library for SAT: a Manifesto. 290-310 - Sheila Mcllraith, Eyal Amir:
Theorem Proving with Structured Theories (Preliminary Report)*. 311-328 - Eyal Amir, Sheila Mcllraith:
Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report). 329-343 - Michail G. Lagoudakis, Michael L. Littman:
Learning to Select Branching Rules in the DPLL Procedure for Satisfiability. 344-359 - Donald J. Patterson, Henry A. Kautz:
Auto-Walksat: A Self-Tuning Implementation of Walksat. 360-368 - K. Subramani:
A polyhedral projection procedure for Q2SAT. 369-375 - Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Henry A. Kautz, Bart Selman, David Maxwell Chickering:
A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report). 376-391 - Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes:
Extending the Reach of SAT with Many-Valued Logics. 392-407
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-03-08 00:46 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:
