11 found
Order:
  1.  7
    On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and N-Person Games.Phan Minh Dung - 1995 - Artificial Intelligence 77 (2):321-357.
  2. Fundamental Properties of Attack Relations in Structured Argumentation with Priorities.Phan Minh Dung & Phan Minh Thang - 2018 - Artificial Intelligence 255:1-42.
  3.  65
    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  
  4.  10
    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.
  5.  1
    An Axiomatic Analysis of Structured Argumentation with Priorities.Phan Minh Dung - 2016 - Artificial Intelligence 231:107-150.
  6.  62
    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  
  7.  54
    The Modular Logic of Private International Law.Phan Minh Dung & Giovanni Sartor - 2011 - Artificial Intelligence and Law 19 (2-3):233-261.
    We provide a logical analysis of private international law, a rather esoteric, but increasingly important, domain of the law. Private international law addresses overlaps and conflicts between legal systems by distributing cases between the authorities of such systems (jurisdiction) and establishing what rules these authorities have to apply to each case (choice of law). A formal model of the resulting interactions between legal systems is proposed based on modular argumentation. It is argued that this model may also be useful for (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  9
    Modelling Last-Act Attempted Crime in Criminal Law.Jiraporn Pooksook, Phan Minh Dung, Ken Satoh & Giovanni Sartor - 2019 - Journal of Applied Non-Classical Logics 29 (4):327-357.
    In the court of law, a person can be punished for attempting to commit a crime. An open issue in the study of Artificial Intelligence and Law is whether the law of attempts could be formally modelled. There are distinct legal rules for determining attempted crime whereas the last-act rule (also called proximity rule) represents the strictest approach. In this paper, we provide a formal model of the last-act rule using structured argumentation.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  9.  1
    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  
  10. An Argument-Based Approach to Reasoning with Specificity.Phan Minh Dung & Tran Cao Son - 2001 - Artificial Intelligence 133 (1-2):35-85.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  31
    Knowledge Base Dynamics, Abduction, and Database Updates.Chandrabose Aravindan & Phan Minh Dung - 1995 - Journal of Applied Non-Classical Logics 5 (1):51-76.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation