Theory and Applications of Satisfiability Testing – SAT 2017 [electronic resource] : 20th International Conference, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings / edited by Serge Gaspers, Toby Walsh.
Material type:
TextSeries: Theoretical Computer Science and General Issues ; 10491 | Lecture Notes in Computer Science ; 10491Publisher: Cham : Springer International Publishing : Imprint: Springer, 2017Edition: 1st ed. 2017Description: XIII, 476 p. 68 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783319662633Subject(s): Computers | Artificial intelligence | Software engineering | Operating systems (Computers) | Computer organization | Numerical analysis | Theory of Computation | Artificial Intelligence | Software Engineering | Operating Systems | Computer Systems Organization and Communication Networks | Numeric ComputingAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 LOC classification: QA75.5-76.95QA76.63Online resources: Click here to access online
In:
Springer Nature eBookSummary: This book constitutes the refereed proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, held in Melbourne, Australia, in August/September 2017. The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo theories; and SAT encodings.
E-BOOKS
| Current library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| IMSc Library | IMSc Library | Link to resource | Available | EBK14311 |
This book constitutes the refereed proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, held in Melbourne, Australia, in August/September 2017. The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo theories; and SAT encodings.
There are no comments on this title.