HordeQBF: A Modular and Massively Parallel QBF Solver
The recently developed massively parallel satisfiability (SAT) solver HordeSAT was designed in a modular way to allow the integration of any sequential CDCL-based SAT solver in its core. We integrated the QCDCL-based quantified Boolean formula (QBF) solve
- PDF / 15,239,743 Bytes
- 576 Pages / 439.37 x 666.142 pts Page_size
- 109 Downloads / 204 Views
Nadia Creignou Daniel Le Berre (Eds.)
Theory and Applications of Satisfiability Testing – SAT 2016 19th International Conference Bordeaux, France, July 5–8, 2016 Proceedings
123
Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zürich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany
9710
More information about this series at http://www.springer.com/series/7407
Nadia Creignou Daniel Le Berre (Eds.) •
Theory and Applications of Satisfiability Testing – SAT 2016 19th International Conference Bordeaux, France, July 5–8, 2016 Proceedings
123
Editors Nadia Creignou Aix-Marseille Université Marseille France
Daniel Le Berre Université d’Artois Lens France
ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-319-40969-6 ISBN 978-3-319-40970-2 (eBook) DOI 10.1007/978-3-319-40970-2 Library of Congress Control Number: 2016941614 LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues © Springer International Publishing Switzerland 2016 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. Printed on acid-free paper This Springer imprint is published by Springer Nature The registered company is Springer International Publishing AG Switzerland
Preface
This volume contains the papers pres
Data Loading...
