default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal on Satisfiability, Boolean Modeling and Computation, Volume 1
Volume 1, Number 1, March 2006
- Miguel F. Anjos:
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems. 1-47 - Evgeny Dantsin, Alexander Wolpert:
A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length. 49-60 - Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis:
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. 61-88
Volume 1, Number 2, December 2006
- Sean A. Weaver, John V. Franco, John S. Schlipf:
Extending Existential Quantification in Conjunctions of BDDs. 89-110 - Daniel Rolf:
Improved Bound for the PPSZ/Schöning-Algorithm for 3-SAT. 111-122 - Eliezer L. Lozinskii:
Impurity: Another Phase Transition of SAT. 123-141 - Konstantin Kutzkov
:
A Note on the Use of Independent Sets for the k-SAT Problem. 143-145
Volume 1, Numbers 3-4, May 2007
- Youssef Hamadi, Lucas Bordeaux:
Preface to Special Issue on SAT/CP Integration. - Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Recording and Minimizing Nogoods from Restarts. 147-167 - Christophe Lecoutre, Lakhdar Sais, Julien Vion:
Using SAT Encodings to Drive CSP Value Ordering Heuristics. 169-186 - Shuvendu K. Lahiri, Krishna K. Mehra:
Interpolant based Decision Procedure for Quantifier-Free Presburger Arithmetic. 187-207 - Martin Fränzle, Christian Herde, Tino Teige, Stefan Ratschan, Tobias Schubert:
Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure. 209-236
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-12-22 19:01 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:
