Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT

Tobias Paxian, Sven Reimer and Bernd Becker

QBFEVAL’18

Luca Pulina and Martina Seidl

In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving

Marc Vinyals, Jan Elffers, Jesús Giráldez-Crú, Stephan Gocht and Jakob Nordstrom

Constrained Image Generation Using Binarized Neural Networks with Decision Procedures

Svyatoslav Korneev, Nina Narodytska, Luca Pulina, Armando Tacchella, Nikolaj Bjorner and Mooly Sagiv

ALIAS: A Modular Tool for Finding Backdoors for SAT

Stepan Kochemazov and Oleg Zaikin

MaxSAT Evaluation 2018

Fahiem Bacchus, Matti Järvisalo and Ruben Martins

Circuit-based Search Space Pruning in QBF

Mikolas Janota

Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers

Jan Elffers, Jesus Giráldez-Cru, Jakob Nordstrom and Marc Vinyals

Exploiting Treewidth for Projected Model Counting and its Limits

Johannes K. Fichte, Markus Hecher, Michael Morak and Stefan Woltran

PySAT: A Python Toolkit for Prototyping with SAT Oracles

Alexey Ignatiev, Antonio Morgado and Joao Marques-Silva

Centrality-Based Improvements to CDCL Heuristics

Sima Jamali and David Mitchell

Effective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition

Shubhani Gupta, Aseem Saxena, Anmol Mahajan and Sorav Bansal

Machine Learning-based Restart Policy for CDCL SAT Solvers

Jia Liang, Chanseok Oh, Minu Mathews, Ciza Thomas, Chunxiao Li and Vijay Ganesh

XORSAT Set Membership Filters

Sean Weaver, Hannah Roberts and Michael Smith

Fast and Flexible Probabilistic Model Counting

Dimitris Achlioptas, Zayd Hammoudeh and Panos Theodoropoulos

Local Soundness for QBF Calculi

Martin Suda and Bernhard Gleiss

Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization

Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri and Roberto Sebastiani