Conference Paper/Proceeding/Abstract 1669 views
Minimal unsatisfiability and minimal strongly connected digraphs
Theory and Applications of Satisfiability Testing - SAT 2018, Issue: 1
Swansea University Author:
Oliver Kullmann
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.1007/978-3-319-94144-8
Abstract
A new method for classification of minimally unsatisfiable clause-sets (MUs) is introduced, connecting MUs with MSDs, minimal strongly connected digraphs. Two basic characterisations of MUs from the literature, namely for deficiency 2 and 2-CNF (the latter only available as technical report) are giv...
| Published in: | Theory and Applications of Satisfiability Testing - SAT 2018 |
|---|---|
| ISBN: | 978-3-319-42803-1 |
| Published: |
Oxford, UK
Springer Cham
2018
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa39955 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
A new method for classification of minimally unsatisfiable clause-sets (MUs) is introduced, connecting MUs with MSDs, minimal strongly connected digraphs. Two basic characterisations of MUs from the literature, namely for deficiency 2 and 2-CNF (the latter only available as technical report) are given lucid and much shorter proofs. |
|---|---|
| Keywords: |
minimal unsatisfiability, strong digraphs, minimal strongly connected |
| College: |
Faculty of Science and Engineering |
| Issue: |
1 |