| Vol-1719 urn:nbn:de:0074-1719-2 Copyright © 2016 for the individual papers by the papers' authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors.

# QBF 2016
Quantified Boolean Formulas

### Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016)
co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016)

### Bordeaux, France, July 4, 2016.

Edited by

### Florian Lonsing *
Martina Seidl **

* Vienna University of Technology, Knowledge-Based Systems Group, 1040 Vienna, Austria
** Johannes Kepler University Linz, Institute for Formal Models and Verification, 4040 Linz, Austria

## Table of Contents

- Preface

- The Ninth QBF Solvers Evaluation - Preliminary Report (invited paper) 1-13
  Luca Pulina
- QBF Encoding of Generalized Tic-Tac-Toe 14-26
  Diptarama, Ryo Yoshinaka, Ayumi Shinohara
- Dynamic Programming-based QBF Solving 27-40
  Günther Charwat, Stefan Woltran
- Dependency Schemes in QBF Calculi: Semantics and Soundness 41-48
  Joshua Blinkhorn, Olaf Beyersdorff
- ASPQ: An ASP-Based 2QBF Solver 49-54
  Giovanni Amendola, Carmine Dodaro, Francesco Ricca
- The QBF Solver AIGSolve 55-62
  Christoph Scholl, Florian Pigorsch
- SAT-to-SAT in QBFEval 2016 63-70
  Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi

2016-11-02: submitted by Martina Seidl, metadata incl. bibliographic data published under Creative Commons CC0
2016-11-03: published on CEUR-WS.org |valid HTML5|