Minimal Unsatisfiability and Minimal Strongly Connected Digraphs

被引：3
|
作者：
Abbasizanjani, Hoda [1 ]
Kullmann, Oliver [1 ]
机构：
[1] Swansea Univ, Swansea, W Glam, Wales
来源：
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2018 | 2018年 / 10929卷
基金：
英国工程与自然科学研究理事会;
关键词：
COMPLEXITY; 2CNF; REFUTATIONS;
D O I：
10.1007/978-3-319-94144-8_20
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Minimally unsatisfiable clause-sets (MUs) are the hardest unsatisfiable clause-sets. There are two important but isolated characterisations for nonsingular MUs (every literal occurs at least twice), both with ingenious but complicated proofs: Characterising 2-CNF MUs, and characterising MUs with deficiency 2 (two more clauses than variables). Via a novel connection to Minimal Strong Digraphs (MSDs), we give short and intuitive new proofs of these characterisations, revealing an underlying common structure.
引用
收藏
页码：329 / 345
页数：17
相关论文
共 50 条
  • [1] Variable minimal unsatisfiability
    Chen, Zhenyu
    Ding, Decheng
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2006, 3959 : 262 - 273
  • [2] MUP: A minimal unsatisfiability prover
    Huang, Jinbo
    ASP-DAC 2005: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2005, : 432 - 437
  • [3] On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
    Leonid Khachiyan
    Endre Boros
    Khaled Elbassioni
    Vladimir Gurvich
    Algorithmica, 2008, 50
  • [4] On minimal strongly connected congruences of a directed path
    Mirzayanov, M. R.
    IZVESTIYA SARATOVSKOGO UNIVERSITETA NOVAYA SERIYA-MATEMATIKA MEKHANIKA INFORMATIKA, 2006, 6 (01): : 91 - 95
  • [5] C-MINIMAL STRONGLY CONNECTED GRAPHS
    CHATY, G
    COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1968, 266 (18): : 907 - &
  • [6] On enumerating minimal dicuts and strongly connected subgraphs
    Khachiyan, Leonid
    Boros, Endre
    Elbassioni, Khaled
    Gurvich, Vladimir
    ALGORITHMICA, 2008, 50 (01) : 159 - 172
  • [7] Web Service Composition As Minimal Unsatisfiability
    Wakrime, Abderrahim Ait
    Jabbour, Said
    Belabed, Amine
    2016 INTERNATIONAL CONFERENCE ON ELECTRICAL AND INFORMATION TECHNOLOGIES (ICEIT), 2016, : 61 - 66
  • [8] On semidefinite least squares and minimal unsatisfiability
    Anjos, Miguel F.
    Vieira, Manuel V. C.
    DISCRETE APPLIED MATHEMATICS, 2017, 217 : 79 - 96
  • [9] Minimal Unsatisfiability: Models, Algorithms & Applications
    Marques-Silva, Joao
    40TH IEEE INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC ISMVL 2010, 2010, : 9 - 14
  • [10] THEOREM ON STRONGLY CONNECTED DIGRAPHS
    LIEN, YE
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 22 (01): : A44 - A44
12345