Theory and Applications of Satisfiability Testing ¿ SAT 2018 : 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9¿12, 2018, Proceedings

Christoph M. Wintersteiger

ISBN 10: 3319941437 / ISBN 13: 9783319941431

Verlag: Springer International Publishing, Springer International Publishing, 2018

Beschreibung

Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 21st InternationalConference on Theory and Applications of Satisfiability Testing, SAT2018, held in Oxford, UK, in July 2018.The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers addressdifferent aspects ofSAT interpreted in a broad sense, including theoreticaladvances (such as exact algorithms, proof complexity, and other complexity issues),practical search algorithms, knowledge compilation, implementation-leveldetails of SAT solvers and SAT-based systems, problem encodings and reformulations,applications as well ascase studies and reports on findings based onrigorous experimentation. They are organized in the following topical sections: maximum satisfiability; conflict driven clause learning; model counting; quantified Boolean formulae; theory; minimally unsatisfiable sets; satisfiability modulo theories; and tools and applications.

Bestandsnummer des Verkäufers 9783319941431

Bibliografische Details

• Titel: Theory and Applications of Satisfiability Testing ¿ SAT 2018 : 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9¿12, 2018, Proceedings
• Verlag: Springer International Publishing, Springer International Publishing
• Veröffentlichungsdatum: 2018
• Sprache: Englisch
• ISBN-10: 3319941437
• ISBN-13: 9783319941431
• Bindung: Taschenbuch
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

This book constitutes the refereed proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018, held in Oxford, UK, in July 2018.

The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers address different aspects of SAT interpreted in a broad sense, including theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications as well as case studies and reports on findings based on rigorous experimentation. They are organized in the following topical sections: maximum satisfiability; conflict driven clause learning; model counting; quantified Boolean formulae; theory; minimally unsatisfiable sets; satisfiability modulo theories; and tools and applications.