📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Minimal Unsatisfiability and Minimal Strongly Connected Digraphs

First Author: Abbasizanjani H

Attributed to: COMBINATORIC OF MINIMALLY UNSATISFIABLE CLAUSE-SETS 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