![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Journal on Satisfiability, Boolean Modeling and Computation, Volume 7
Volume 7, Number 1, 2010
- Marina Langlois, Robert H. Sloan, György Turán:
Horn Upper Bounds and Renaming. 1-15 - Jiwei Jin, Xishun Zhao:
Resolution on Quantified Generalized Clause-sets.. 17-34 - Olga Tveretina, Carsten Sinz, Hans Zantema:
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. 35-58
Volume 7, Numbers 2-3, 2010
- Daniel Le Berre, Anne Parrain:
The Sat4j library, release 2.2. 59-6 - Luca Pulina, Armando Tacchella:
AQME'10. 65-70 - Florian Lonsing, Armin Biere:
DepQBF: A Dependency-Aware QBF Solver. 71-76 - Adrian Balint, Daniel Gall, Gregor Kapler, Robert Retz:
Experiment design and administration for computer clusters for SAT-solvers (EDACC). 77-82 - Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
QuBE7.0. 83-88
- Federico Heras, David Bañeres:
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers. 89-126
Volume 7, Number 4, 2011
- Youssef Hamadi, Saïd Jabbour, Cédric Piette, Lakhdar Sais:
Deterministic Parallel DPLL. 127-132 - Peter van der Tak, Antonio Ramos, Marijn Heule:
Reusing the Assignment Trail in CDCL Solvers. 133-138 - Olivier Roussel:
Controlling a Solver Execution with the runsolver Tool. 139-144
- Steve Haynal, Heidi Haynal:
Generating and Searching Families of FFT Algorithms. 145-187
- Magnus Björk:
Successful SAT Encoding Techniques. 189-201
![](https://dblp.org/img/cog.dark.24x24.png)
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.