Algorithms for computing minimal conflicts

被引：1
|
作者：
Luan, Shangmin [1 ]
Magnani, Lorenzo
Dai, Guozhong
机构：
[1] Chinese Acad Sci, Inst Software, Beijing, Peoples R China
[2] Beijing Inst Technol, Sch Comp Sci & Technol, Beijing 100081, Peoples R China
[3] Univ Pavia, Dept Philosophy, I-27100 Pavia, Italy
[4] Univ Pavia, Computat Philosophy Lab, I-27100 Pavia, Italy
[5] Sun Yat Sen Univ, Guangzhou, Peoples R China
来源：
LOGIC JOURNAL OF THE IGPL | 2006年 / 14卷 / 02期
关键词：
model-based diagnosis; minimal conflict; algorithm; observation;
D O I：
10.1093/jigpal/jzk026
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper we present some algorithms for computing minimal conflicts. First of all we discuss the relationship between minimal conflicts and minimally inconsistent subsets. Then we introduce an algorithm for computing all minimally inconsistent subsets, which is applied to generating all minimal conflicts. Furthermore, an algorithm for computing all minimal conflicts using structured description is introduced, and its correctness is proved; its time complexity is also shown. The algorithm using structured description terminates in polynomial time for some special system, such as the tree-structured systems. The algorithms are also compared with related works.
引用
收藏
页码：391 / 406
页数：16
相关论文
共 50 条
  • [1] Computing minimal conflicts for rich constraint languages
    Mauss, J
    Tatar, M
    [J]. ECAI 2002: 15TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2002, 77 : 151 - 155
  • [2] Algorithms for computing minimal equivalent subformulas
    Belov, Anton
    Janota, Mikolas
    Lynce, Ines
    Marques-Silva, Joao
    [J]. ARTIFICIAL INTELLIGENCE, 2014, 216 : 309 - 326
  • [3] Algorithms for computing minimal unsatisfiable subsets of constraints
    Liffiton, Mark H.
    Sakallah, Karem A.
    [J]. JOURNAL OF AUTOMATED REASONING, 2008, 40 (01) : 1 - 33
  • [4] Reliable algorithms for computing minimal dynamic covers
    Varga, A
    [J]. 42ND IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, PROCEEDINGS, 2003, : 1873 - 1878
  • [5] Efficient Algorithms for Computing a Minimal Homology Basis
    Dey, Tamal K.
    Li, Tianqi
    Wang, Yusu
    [J]. LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 376 - 398
  • [6] Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
    Mark H. Liffiton
    Karem A. Sakallah
    [J]. Journal of Automated Reasoning, 2008, 40 : 1 - 33
  • [7] DISJOINT TASK ALLOCATION ALGORITHMS FOR MIN MACHINES WITH MINIMAL CONFLICTS
    YU, CS
    DAS, CR
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1995, 6 (04) : 373 - 387
  • [8] Comparison and improvement of algorithms for computing minimal cut sets
    Christian Jungreuthmayer
    Govind Nair
    Steffen Klamt
    Jürgen Zanghellini
    [J]. BMC Bioinformatics, 14
  • [9] Comparison and improvement of algorithms for computing minimal cut sets
    Jungreuthmayer, Christian
    Nair, Govind
    Klamt, Steffen
    Zanghellini, Juergen
    [J]. BMC BIOINFORMATICS, 2013, 14
  • [10] Modular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial Ideals
    Aoyama, Toru
    Noro, Masayuki
    [J]. ISSAC'18: PROCEEDINGS OF THE 2018 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 2018, : 31 - 38
12345