default search action
Journal on Satisfiability, Boolean Modeling and Computation, Volume 11
Volume 11, Number 1, 2019
Special Volume on SAT 2018 Competitive Events
- Luca Pulina, Martina Seidl:
Notes from the Guest Editors. 1 - Ralf Wimmer, Christoph Scholl, Bernd Becker:
The (D)QBF Preprocessor HQSpre - Underlying Theory and Its Implementation. 3-52 - Alexey Ignatiev, António Morgado, João Marques-Silva:
RC2: an Efficient MaxSAT Solver. 53-64 - William Klieber:
GhostQ. 65-72 - Saurabh Joshi, Prateek Kumar, Sukrut Rao, Ruben Martins:
Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT. 73-97 - Fahiem Bacchus, Matti Järvisalo, Ruben Martins:
MaxSAT Evaluation 2018: New Developments and Detailed Results. 99-131 - Marijn J. H. Heule, Matti Järvisalo, Martin Suda:
SAT Competition 2018. 133-154 - Leander Tentrup:
CAQE and QuAbS: Abstraction Based QBF Solvers. 155-210 - Florian Lonsing:
QBFRelay, QRATPre+, and DepQBF: Incremental Preprocessing Meets Search-Based QBF Solving. 211-220 - Tjark Weber, Sylvain Conchon, David Déharbe, Matthias Heizmann, Aina Niemetz, Giles Reger:
The SMT Competition 2015-2018. 221-259 - Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Qute in the QBF Evaluation 2018. 261-272
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.