default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal on Satisfiability, Boolean Modeling and Computation, Volume 6
Volume 6, Number 1-3, May 2009
- Stefan Szeider:
Matched Formulas and Backdoor Sets. 1-12 - Utz-Uwe Haus, Klaus Truemper, Robert Weismantel:
Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling Networks. 13-32 - Roman Gershman, Ofer Strichman:
HaifaSat: a SAT solver based on an Abstraction/Refinement model. 33-51 - Edward A. Hirsch, Arist Kojevnikov, Alexander S. Kulikov, Sergey I. Nikolenko:
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. 53-69 - Luís Gil, Paulo F. Flores, Luís Miguel Silveira:
PMSat: a parallel version of MiniSAT. 71-98 - Geoffrey Chu, Aaron Harwood, Peter J. Stuckey:
Cache Conscious Data Structures for Boolean Satisfiability Solvers. 99-120 - Christoph Buchheim, Giovanni Rinaldi:
Terse Integer Linear Programs for Boolean Optimization. 121-139 - Alexander Hertel, Alasdair Urquhart:
Algorithms and Complexity Results for Input and Unit Resolution. 141-164 - Robert Brummayer, Armin Biere:
Lemmas on Demand for the Extensional Theory of Arrays. 165-201
Volume 6, Number 4, June 2009
- Tobias Schubert, Matthew Lewis, Bernd Becker:
PaMiraXT: Parallel SAT Solving with Threads and Message Passing. 203-222 - Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Incorporating Clause Learning in Grid-Based Randomized SAT Solving. 223-244 - Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
ManySAT: a Parallel SAT Solver. 245-262 - Youssef Hamadi:
Conclusion to the Special Issue on Parallel SAT Solving. 263
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-11-28 20:30 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:
