default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal on Satisfiability, Boolean Modeling and Computation, Volume 4
Volume 4, Number 1, April 2008
- Balázs Szörényi:
Disjoint DNF Tautologies with Conflict Bound Two. 1-14 - Miguel F. Anjos:
An Extended Semidefinite Relaxation for Satisfiability. 15-31 - Sriyankar Acharyya:
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results. 33-55 - Yury Chebiryak, Daniel Kroening:
Towards a Classification of Hamiltonian Cycles in the 6-Cube. 57-74
Volume 4, Number 2-4, September 2008
- Armin Biere:
PicoSAT Essentials. 75-97 - Marijn Heule, Hans van Maaren:
Parallel SAT Solving using Bit-level Operations. 99-116 - Marijn Heule, Hans van Maaren:
Whose side are you on? Finding solutions in a biased search-tree. 117-148 - Duc Nghia Pham, John Thornton, Charles Gretton, Abdul Sattar:
Combining Adaptive and Dynamic Local Search for Satisfiability. 149-172 - Ivor T. A. Spence:
tts: A SAT-Solver for Small, Difficult Instances. 173-190 - Knot Pipatsrisawat, Akop Palyan, Mark Chavira, Arthur Choi, Adnan Darwiche:
Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis. 191-217 - Wanxia Wei, Chu Min Li, Harry Zhang:
A Switching Criterion for Intensification and Diversification in Local Search for SAT. 219-237 - Federico Heras, Javier Larrosa, Simon de Givry, Thomas Schiex:
2006 and 2007 Max-SAT Evaluations: Contributed Instances. 239-250 - Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes:
The First and Second Max-SAT Evaluations. 251-278 - Ewald Speckenmeyer, Armando Tacchella, Vasco Manquinho, Chu Min Li:
Guest Editors Conclusion.
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-30 20:33 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:
