No Cover Image

Conference Paper/Proceeding/Abstract 1368 views

Minimal unsatisfiability and minimal strongly connected digraphs

Hoda Abbasizanjani, Oliver Kullmann Orcid Logo

Theory and Applications of Satisfiability Testing - SAT 2018, Issue: 1

Swansea University Author: Oliver Kullmann Orcid Logo

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...

Full description

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!
first_indexed 2018-05-04T13:54:20Z
last_indexed 2023-04-15T02:50:23Z
id cronfa39955
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2023-04-14T14:54:26.9910499</datestamp><bib-version>v2</bib-version><id>39955</id><entry>2018-05-04</entry><title>Minimal unsatisfiability and minimal strongly connected digraphs</title><swanseaauthors><author><sid>2b410f26f9324d6b06c2b98f67362d05</sid><ORCID>0000-0003-3021-0095</ORCID><firstname>Oliver</firstname><surname>Kullmann</surname><name>Oliver Kullmann</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2018-05-04</date><deptcode>SCS</deptcode><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.</abstract><type>Conference Paper/Proceeding/Abstract</type><journal>Theory and Applications of Satisfiability Testing - SAT 2018</journal><volume/><journalNumber>1</journalNumber><paginationStart/><paginationEnd/><publisher>Springer Cham</publisher><placeOfPublication>Oxford, UK</placeOfPublication><isbnPrint/><isbnElectronic>978-3-319-42803-1</isbnElectronic><issnPrint/><issnElectronic/><keywords>minimal unsatisfiability, strong digraphs, minimal strongly connected</keywords><publishedDay>27</publishedDay><publishedMonth>6</publishedMonth><publishedYear>2018</publishedYear><publishedDate>2018-06-27</publishedDate><doi>10.1007/978-3-319-94144-8</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><funders/><projectreference/><lastEdited>2023-04-14T14:54:26.9910499</lastEdited><Created>2018-05-04T09:10:01.5777410</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Hoda</firstname><surname>Abbasizanjani</surname><order>1</order></author><author><firstname>Oliver</firstname><surname>Kullmann</surname><orcid>0000-0003-3021-0095</orcid><order>2</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2023-04-14T14:54:26.9910499 v2 39955 2018-05-04 Minimal unsatisfiability and minimal strongly connected digraphs 2b410f26f9324d6b06c2b98f67362d05 0000-0003-3021-0095 Oliver Kullmann Oliver Kullmann true false 2018-05-04 SCS 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. Conference Paper/Proceeding/Abstract Theory and Applications of Satisfiability Testing - SAT 2018 1 Springer Cham Oxford, UK 978-3-319-42803-1 minimal unsatisfiability, strong digraphs, minimal strongly connected 27 6 2018 2018-06-27 10.1007/978-3-319-94144-8 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2023-04-14T14:54:26.9910499 2018-05-04T09:10:01.5777410 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Hoda Abbasizanjani 1 Oliver Kullmann 0000-0003-3021-0095 2
title Minimal unsatisfiability and minimal strongly connected digraphs
spellingShingle Minimal unsatisfiability and minimal strongly connected digraphs
Oliver Kullmann
title_short Minimal unsatisfiability and minimal strongly connected digraphs
title_full Minimal unsatisfiability and minimal strongly connected digraphs
title_fullStr Minimal unsatisfiability and minimal strongly connected digraphs
title_full_unstemmed Minimal unsatisfiability and minimal strongly connected digraphs
title_sort Minimal unsatisfiability and minimal strongly connected digraphs
author_id_str_mv 2b410f26f9324d6b06c2b98f67362d05
author_id_fullname_str_mv 2b410f26f9324d6b06c2b98f67362d05_***_Oliver Kullmann
author Oliver Kullmann
author2 Hoda Abbasizanjani
Oliver Kullmann
format Conference Paper/Proceeding/Abstract
container_title Theory and Applications of Satisfiability Testing - SAT 2018
container_issue 1
publishDate 2018
institution Swansea University
isbn 978-3-319-42803-1
doi_str_mv 10.1007/978-3-319-94144-8
publisher Springer Cham
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 0
active_str 0
description 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.
published_date 2018-06-27T03:50:49Z
_version_ 1763752489085042688
score 11.01409

Similar Items