Counting complexity of propositional abduction

被引：10
|
作者：
Hermann, Miki [1 ]
Pichler, Reinhard [2 ]
机构：
[1] Ecole Polytech, LIX, CNRS, UMR 7161, F-91128 Palaiseau, France
[2] Vienna Univ Technol, Inst Informat Syst, A-1040 Vienna, Austria
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2010年 / 76卷 / 07期
基金：
奥地利科学基金会;
关键词：
Computational complexity; Counting complexity; Propositional abduction; Horn; Definite Horn; Dual Horn; Bijunctive formulas;
D O I：
10.1016/j.jcss.2009.12.001
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Abduction is an important method of non-monotonic reasoning with many applications in artificial intelligence and related topics. In this paper, we concentrate on propositional abduction, where the background knowledge is given by a propositional formula. Decision problems of great interest are the existence and the relevance problems. The complexity of these decision problems has been systematically studied while the counting complexity of propositional abduction has remained obscure. The goal of this work is to provide a comprehensive analysis of the counting complexity of propositional abduction in various settings. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码：634 / 649
页数：16
相关论文
共 50 条
  • [1] Counting Complexity of Propositional Abduction
    Hermann, Miki
    Pichler, Reinhard
    20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2007, : 417 - 422
  • [2] A complete classification of the complexity of propositional abduction
    Creignou, Nadia
    Zanuttini, Bruno
    SIAM JOURNAL ON COMPUTING, 2006, 36 (01) : 207 - 229
  • [3] On the counting complexity of propositional circumscription
    Durand, Arnaud
    Hermann, Miki
    INFORMATION PROCESSING LETTERS, 2008, 106 (04) : 164 - 170
  • [4] Complexity Classifications for Propositional Abduction in Post's Framework
    Creignou, Nadia
    Schmidt, Johannes
    Thomas, Michael
    JOURNAL OF LOGIC AND COMPUTATION, 2012, 22 (05) : 1145 - 1170
  • [5] Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
    Hermann, Miki
    Pichler, Reinhard
    LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2008, 5293 : 206 - +
  • [6] Compilability of propositional abduction
    Liberatore, Paolo
    Schaerf, Marco
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2007, 8 (01)
  • [7] What makes propositional abduction tractable
    Nordh, Gustav
    Zanuttini, Bruno
    ARTIFICIAL INTELLIGENCE, 2008, 172 (10) : 1245 - 1284
  • [8] Propositional Abduction with Implicit Hitting Sets
    Ignatiev, Alexey
    Morgado, Antonio
    Marques-Silva, Joao
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 1327 - 1335
  • [9] Propositional Abduction is Almost Always Hard
    Nordh, Gustav
    Zanuttini, Bruno
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 534 - 539
  • [10] On the complexity of abduction
    Marek, VW
    Nerode, A
    Remmel, JB
    11TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1996, : 513 - 522
12345