Abstract Dialectical Frameworks for Legal Reasoning

被引：15
|
作者：
Al-Abdulkarim, Latifa [1 ]
Atkinson, Katie [1 ]
Bench-Capon, Trevor [1 ]
机构：
[1] Univ Liverpool, Dept Comp Sci, Liverpool, Merseyside, England
来源：
LEGAL KNOWLEDGE AND INFORMATION SYSTEMS | 2014年 / 271卷
关键词：
case based reasoning; factors; argumentation frameworks;
D O I：
10.3233/978-1-61499-468-8-61
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In recent years a powerful generalisation of Dung's abstract argumentation frameworks, Abstract Dialectical Frameworks (ADF), has been developed. ADFs generalise the abstract argumentation frameworks introduced by Dung by replacing Dung's single acceptance condition (that all attackers be defeated) with acceptance conditions local to each particular node. Such local acceptance conditions allow structured argumentation to be straightforwardly incorporated. Related to ADFs are prioritised ADFs, which allow for reasons pro and con a node. In this paper we show how these structures provide an excellent framework for representing a leading approach to reasoning with legal cases.
引用
收藏
页码：61 / 70
页数：10
相关论文
共 50 条
  • [41] Quantitative Reasoning over Incomplete Abstract Argumentation Frameworks
    Fazzinga, Bettina
    Flesca, Sergio
    Furfaro, Filippo
    Monterosso, Giuseppina
    PROCEEDINGS OF THE THIRTY-THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2024, 2024, : 3360 - 3368
  • [42] On the Computational Complexity of Naive-based Semantics for Abstract Dialectical Frameworks
    Gaggl, Sarah Alice
    Rudolph, Sebastian
    Strass, Hannes
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 2985 - 2991
  • [43] Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
    Strass, Hannes
    Wallner, Johannes Peter
    ARTIFICIAL INTELLIGENCE, 2015, 226 : 34 - 74
  • [44] Instantiating rule-based defeasible theories in abstract dialectical frameworks and beyond
    Strass, Hannes
    JOURNAL OF LOGIC AND COMPUTATION, 2018, 28 (03) : 605 - 627
  • [45] Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory
    Strass, Hannes
    Wallner, Johannes Peter
    FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2014, : 101 - 110
  • [46] Stable Model Semantics of Abstract Dialectical Frameworks Revisited: A Logic Programming Perspective
    Alviano, Mario
    Faber, Wolfgang
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 2684 - 2690
  • [47] Revision, defeasible conditionals and non-monotonic inference for abstract dialectical frameworks
    Heyninck, Jesse
    Kern-Isberner, Gabriele
    Rienstra, Tjitze
    Skiba, Kenneth
    Thimm, Matthias
    ARTIFICIAL INTELLIGENCE, 2023, 317
  • [48] Developing Content for LKIF: Ontologies and Frameworks for Legal Reasoning
    Breuker, Joost
    Boer, Alexander
    Hoekstra, Rinke
    van den Berg, Kasper
    LEGAL KNOWLEDGE AND INFORMATION SYSTEMS, 2006, 152 : 169 - 174
  • [49] Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving
    Linsbichler, Thomas
    Maratea, Marco
    Niskanen, Andreas
    Wallner, Johannes P.
    Woltran, Stefan
    PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 1905 - 1911
  • [50] Bipolar Abstract Dialectical Frameworks Are Covered by Kleene's Three-valued Logic
    Baumann, Ringo
    Heinrich, Maximilian
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 3123 - 3131
12345