Theory and Applications of Satisfiability Testing – SAT 2017

Beschreibung

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.

Includes supplementary material: sn.pub/extras

Autor*in

Serge Gaspers

Themen in »Theory and Applications of Satisfiability Testing – SAT 2017«

artificial intelligence computer architecture computer software selection and evaluation constraint theory formal logic formal methods formal verifications genetic algorithms learning algorithms learning systems machine learning model checking problem solving program processors sat solvers

Stimmen zu »Theory and Applications of Satisfiability Testing – SAT 2017«

Details

Link teilen