Minimal Unsatisfiability and Minimal Strongly Connected Digraphs
Attributed to:
The next level of SAT solving for very hard problems
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-319-94144-8_20
Publication URI: http://dx.doi.org/10.1007/978-3-319-94144-8_20
Type: Book Chapter
Book Title: 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 (2018)
Page Reference: 329-345