Switch to: Citations

Add references

You must login to add references.
  1. Padua: A Protocol for Argumentation Dialogue Using Association Rules. [REVIEW]Maya Wardeh, Trevor Bench-Capon & Frans Coenen - 2009 - Artificial Intelligence and Law 17 (3):183-215.
    We describe PADUA, a protocol designed to support two agents debating a classification by offering arguments based on association rules mined from individual datasets. We motivate the style of argumentation supported by PADUA, and describe the protocol. We discuss the strategies and tactics that can be employed by agents participating in a PADUA dialogue. PADUA is applied to a typical problem in the classification of routine claims for a hypothetical welfare benefit. We particularly address the problems that arise from the (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Defeasible Logic Programming: DeLP-Servers, Contextual Queries, and Explanations for Answers.Alejandro J. García & Guillermo R. Simari - 2014 - Argument and Computation 5 (1):63-88.
    Argumentation represents a way of reasoning over a knowledge base containing possibly incomplete and/or inconsistent information, to obtain useful conclusions. As a reasoning mechanism, the way an argumentation reasoning engine reaches these conclusions resembles the cognitive process that humans follow to analyze their beliefs; thus, unlike other computationally reasoning systems, argumentation offers an intellectually friendly alternative to other defeasible reasoning systems. LogicProgrammingisacomputationalparadigmthathasproducedcompu- tationallyattractivesystemswithremarkablesuccessinmanyapplications. Merging ideas from both areas, Defeasible Logic Programming offers a computational reasoning system that uses an argumentation engine (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Argument-Based Extended Logic Programming with Defeasible Priorities.Henry Prakken & Giovanni Sartor - 1997 - Journal of Applied Non-Classical Logics 7 (1-2):25-75.
    ABSTRACT Inspired by legal reasoning, this paper presents a semantics and proof theory of a system for defeasible argumentation. Arguments are expressed in a logic-programming language with both weak and strong negation, conflicts between arguments are decided with the help of priorities on the rules. An important feature of the system is that these priorities are not fixed, but are themselves defeasibly derived as conclusions within the system. Thus debates on the choice between conflicting arguments can also be modelled. The (...)
    Download  
     
    Export citation  
     
    Bookmark   54 citations