Reasoning in abstract dialectical frameworks using quantified Boolean formulas

被引：11
|
作者：
Diller, Martin [1 ]
Wallner, Johannes Peter [1 ]
Woltran, Stefan [1 ]
机构：
[1] Vienna Univ Technol, Inst Informat Syst, Favoritenstr 9-11, A-1040 Vienna, Austria
来源：
ARGUMENT & COMPUTATION | 2015年 / 6卷 / 02期
基金：
奥地利科学基金会;
关键词：
abstract dialectical frameworks; quantified Boolean formulas; computational complexity; encodings;
D O I：
10.1080/19462166.2015.1036922
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
.Abstract dialectical frameworks (ADFs) constitute a recent and powerful generalisation of Dung's argumentation frameworks (AFs), where the relationship between the arguments can be specified via Boolean formulas. Recent results have shown that this enhancement comes with the price of higher complexity compared to AFs. In fact, acceptance problems in the world of ADFs can be hard even for the third level of the polynomial hierarchy. In order to implement reasoning problems on ADFs, systems for quantified Boolean formulas (QBFs) thus are suitable engines to be employed. In this paper we give complexity sensitive QBF encodings of ADF problems generalising recent work on QBFs for AF labellings. Our encodings provide a uniform and modular way of translating reasoning in ADFs to QBFs, that can be used as the basis for novel systems for ADF reasoning.
引用
收藏
页码：149 / 177
页数：29
相关论文
共 50 条
  • [1] Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas
    Diller, Martin
    Wallner, Johannes Peter
    Woltran, Stefan
    [J]. COMPUTATIONAL MODELS OF ARGUMENT, 2014, 266 : 241 - 252
  • [2] Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
    Egly, Uwe
    Woltran, Stefan
    [J]. COMPUTATIONAL MODELS OF ARGUMENT, 2006, 144 : 133 - 144
  • [3] Reasoning with quantified boolean formulas
    Giunchiglia, Enrico
    Marin, Paolo
    Narizzano, Massimo
    [J]. Frontiers in Artificial Intelligence and Applications, 2009, 185 (01) : 761 - 780
  • [4] Solving advanced reasoning tasks using quantified Boolean formulas
    Egly, U
    Eiter, T
    Tompits, H
    Woltran, S
    [J]. SEVENTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-2001) / TWELFTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-2000), 2000, : 417 - 422
  • [5] Abstract Dialectical Frameworks for Legal Reasoning
    Al-Abdulkarim, Latifa
    Atkinson, Katie
    Bench-Capon, Trevor
    [J]. LEGAL KNOWLEDGE AND INFORMATION SYSTEMS, 2014, 271 : 61 - 70
  • [6] Abstract Solvers for Quantified Boolean Formulas and their Applications
    Brochenin, Remi
    Maratea, Marco
    [J]. AI*IA 2015: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2015, 9336 : 205 - 217
  • [7] A Structural Approach to Reasoning with Quantified Boolean Formulas
    Pulina, Luca
    Tacchella, Armando
    [J]. 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 596 - 602
  • [8] Propositional PSPACE reasoning with boolean programs versus quantified Boolean formulas
    Skelley, A
    [J]. AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 1163 - 1175
  • [9] Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas
    Pulina, Luca
    Tacchella, Armando
    [J]. FRONTIERS OF COMBINING SYSTEMS, PROCEEDINGS, 2009, 5749 : 350 - 365
  • [10] On models for quantified Boolean formulas
    Büning, HK
    Zhao, XS
    [J]. LOGIC VERSUS APPROXIMATION: ESSAYS DEDICATED TO MICHAEL M RICHTER ON THE OCCASION OF HIS 65TH BIRTHDAY, 2004, 3075 : 18 - 32
12345