6 found
Order:
  1. Modular argumentation for modelling legal doctrines in common law of contract.Phan Minh Dung & Phan Minh Thang - 2009 - Artificial Intelligence and Law 17 (3):167-182.
    To create a programming environment for contract dispute resolution, we propose an extension of assumption-based argumentation into modular assumption-based argumentation in which different modules of argumentation representing different knowledge bases for reasoning about beliefs and facts and for representation and reasoning with the legal doctrines could be built and assembled together. A distinct novel feature of modular argumentation in compare with other modular logic-based systems like Prolog is that it allows references to different semantics in the same module at the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  2.  23
    Fundamental properties of attack relations in structured argumentation with priorities.Phan Minh Dung & Phan Minh Thang - 2018 - Artificial Intelligence 255 (C):1-42.
  3.  26
    Representing the semantics of abstract dialectical frameworks based on arguments and attacks.Phan Minh Dung & Phan Minh Thang - 2018 - Argument and Computation 9 (3):249-267.
  4.  92
    Modular argumentation for modelling legal doctrines of performance relief.Nguyen Duy Hung, Phan Minh Thang & Phan Minh Dung - 2010 - Argument and Computation 1 (1):47-69.
    We present an argument-based formalism of contract dispute resolution following a modern view that the court would resolve a contract dispute by enforcing an interpretation of contract that reasonably represents the mutual intention of contract parties. Legal doctrines provide principles, rules and guidelines for the court to objectively arrive at such an interpretation. In this paper, we establish the appropriateness of the formalism by applying it to resolve disputes about performance relief with the legal doctrines of impossibility and frustration of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  11
    ω-Groundedness of argumentation and completeness of grounded dialectical proof procedures.Phan Minh Dung, Phan Minh Thang & Jiraporn Pooksook - 2024 - Argument and Computation:1-45.
    Dialectical proof procedures in assumption-based argumentation are in general sound but not complete with respect to both the credulous and skeptical semantics (due to non-terminating loops). This raises the question of whether we could describe exactly what such procedures compute. In a previous paper, we introduce infinite arguments to represent possibly non-terminating computations and present dialectical proof procedures that are both sound and complete with respect to the credulous semantics of assumption-based argumentation with infinite arguments. In this paper, we study (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  18
    Infinite arguments and semantics of dialectical proof procedures.Phan Minh Thang, Phan Minh Dung & Jiraporn Pooksook - 2022 - Argument and Computation 13 (2):121-157.
    We study the semantics of dialectical proof procedures. As dialectical proof procedures are in general sound but not complete wrt admissibility semantics, a natural question here is whether we could give a more precise semantical characterization of what they compute. Based on a new notion of infinite arguments representing loops, we introduce a stricter notion of admissibility, referred to as strict admissibility, and show that dialectical proof procedures are in general sound and complete wrt strict admissibility.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark