Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)The Carneades model of argument and burden of proof.Thomas F. Gordon, Henry Prakken & Douglas Walton - 2007 - Artificial Intelligence 171 (10-15):875-896.
    We present a formal, mathematical model of argument structure and evaluation, taking seriously the procedural and dialogical aspects of argumentation. The model applies proof standards to determine the acceptability of statements on an issue-by-issue basis. The model uses different types of premises (ordinary premises, assumptions and exceptions) and information about the dialectical status of statements (stated, questioned, accepted or rejected) to allow the burden of proof to be allocated to the proponent or the respondent, as appropriate, for each premise separately. (...)
    Download  
     
    Export citation  
     
    Bookmark   105 citations  
  • A dialectical model of assessing conflicting arguments in legal reasoning.H. Prakken & G. Sartor - 1996 - Artificial Intelligence and Law 4 (3-4):331-368.
    Inspired by legal reasoning, this paper presents a formal framework for assessing conflicting arguments. Its use is illustrated with applications to realistic legal examples, and the potential for implementation is discussed. The framework has the form of a logical system for defeasible argumentation. Its language, which is of a logic-programming-like nature, has both weak and explicit negation, and conflicts between arguments are decided with the help of priorities on the rules. An important feature of the system is that these priorities (...)
    Download  
     
    Export citation  
     
    Bookmark   80 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   471 citations  
  • Dialectical argumentation with argumentation schemes: An approach to legal logic. [REVIEW]Bart Verheij - 2003 - Artificial Intelligence and Law 11 (2-3):167-195.
    This paper describes an approach to legal logic based on the formal analysis of argumentation schemes. Argumentation schemes a notion borrowed from the .eld of argumentation theory - are a kind of generalized rules of inference, in the sense that they express that given certain premises a particular conclusion can be drawn. However, argumentation schemes need not concern strict, abstract, necessarily valid patterns of reasoning, but can be defeasible, concrete and contingently valid, i.e., valid in certain contexts or under certain (...)
    Download  
     
    Export citation  
     
    Bookmark   68 citations  
  • An exercise in formalising teleological case-based reasoning.Henry Prakken - 2002 - Artificial Intelligence and Law 10 (1-3):113-133.
    This paper takes up Berman and Hafner's (1993) challenge to model legal case-based reasoning not just in terms of factual similarities and differences but also in terms of the values that are at stake. The formal framework of Prakken and Sartor (1998) is applied to examples of case-based reasoning involving values, and a method for formalising such examples is proposed. The method makes it possible to express that a case should be decided in a certain way because that advances certain (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • (1 other version)Towards a Formal Account of Reasoning about Evidence: Argumentation Schemes and Generalisations.Bex Floris, Prakken Henry, Reed Chris & Walton Douglas - 2003 - Artificial Intelligence and Law 11 (2-3):125-165.
    This paper studies the modelling of legal reasoning about evidence within general theories of defeasible reasoning and argumentation. In particular, Wigmore's method for charting evidence and its use by modern legal evidence scholars is studied in order to give a formal underpinning in terms of logics for defeasible argumentation. Two notions turn out to be crucial, viz. argumentation schemes and empirical generalisations.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)Towards a formal account of reasoning about evidence: Argumentation schemes and generalisations. [REVIEW]Floris Bex, Henry Prakken, Chris Reed & Douglas Walton - 2003 - Artificial Intelligence and Law 11 (2-3):125-165.
    This paper studies the modelling of legal reasoning about evidence within general theories of defeasible reasoning and argumentation. In particular, Wigmore's method for charting evidence and its use by modern legal evidence scholars is studied in order to give a formal underpinning in terms of logics for defeasible argumentation. Two notions turn out to be crucial, viz. argumentation schemes and empirical generalisations.
    Download  
     
    Export citation  
     
    Bookmark   63 citations  
  • Legal case-based reasoning as practical reasoning.Katie Atkinson & Trevor Bench-Capon - 2005 - Artificial Intelligence and Law 13 (1):93-131.
    In this paper we apply a general account of practical reasoning to arguing about legal cases. In particular, we provide a reconstruction of the reasoning of the majority and dissenting opinions for a particular well-known case from property law. This is done through the use of Belief-Desire-Intention (BDI) agents to replicate the contrasting views involved in the actual decision. This reconstruction suggests that the reasoning involved can be separated into three distinct levels: factual and normative levels and a level connecting (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • (1 other version)The Use of Logical Models in Legal Problem Solving.Robert Kowalski & Marek Sergot - 1990 - Ratio Juris 3 (2):201-218.
    The authors describe a logic programming approach to the representation of legislative texts. They consider the potential uses of simple systems which incorporate a single, fixed interpretation of a text. These include assisting in the routine administration of complex areas of the law. The authors also consider the possibility of constructing more complex systems which incorporate several, possibly conflicting interpretations. Such systems are needed for dealing with ambiguity and vagueness in the law. Moreover, they are more suitable than single interpretation (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Teleological arguments and theory-based dialectics.Giovanni Sartor - 2002 - Artificial Intelligence and Law 10 (1-3):95-112.
    This paper proposes to model legal reasoning asdialectical theory-constructiondirected by teleology. Precedents are viewed asevidence to be explained throughtheories. So, given a background of factors andvalues, the parties in a case canbuild their theories by using a set of operators,which are called theory constructors.The objective of each party is to provide theoriesthat both explain the evidence (theprecedents) and support the decision wished by thatparty. This leads to theory-basedargumentation, i.e., a dialectical exchange ofcompeting theories, which support opposedoutcomes by explaining the same (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • The pleadings game.Thomas F. Gordon - 1993 - Artificial Intelligence and Law 2 (4):239-292.
    The Pleadings Game is a normative formalization and computational model of civil pleading, founded in Roberty Alexy''s discourse theory of legal argumentation. The consequences of arguments and counterarguments are modelled using Geffner and Pearl''s nonmonotonic logic,conditional entailment. Discourse in focussed using the concepts of issue and relevance. Conflicts between arguments can be resolved by arguing about the validity and priority of rules, at any level. The computational model is fully implemented and has been tested using examples from Article Nine of (...)
    Download  
     
    Export citation  
     
    Bookmark   65 citations  
  • A model of legal reasoning with cases incorporating theories and values.Trevor Bench-Capon & Giovanni Sartor - 2003 - Artificial Intelligence 150 (1-2):97-143.
    Reasoning with cases has been a primary focus of those working in AI and law who have attempted to model legal reasoning. In this paper we put forward a formal model of reasoning with cases which captures many of the insights from that previous work. We begin by stating our view of reasoning with cases as a process of constructing, evaluating and applying a theory. Central to our model is a view of the relationship between cases, rules based on cases, (...)
    Download  
     
    Export citation  
     
    Bookmark   69 citations  
  • Abstract argumentation.Robert A. Kowalski & Francesca Toni - 1996 - Artificial Intelligence and Law 4 (3-4):275-296.
    In this paper we explore the thesis that the role of argumentation in practical reasoning in general and legal reasoning in particular is to justify the use of defeasible rules to derive a conclusion in preference to the use of other defeasible rules to derive a conflicting conclusion. The defeasibility of rules is expressed by means of non-provability claims as additional conditions of the rules.We outline an abstract approach to defeasible reasoning and argumentation which includes many existing formalisms, including default (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Coherence in finite argument systems.Paul E. Dunne & T. J. M. Bench-Capon - 2002 - Artificial Intelligence 141 (1-2):187-203.
    Download  
     
    Export citation  
     
    Bookmark   50 citations  
  • An abstract, argumentation-theoretic approach to default reasoning.A. Bondarenko, P. M. Dung, R. A. Kowalski & F. Toni - 1997 - Artificial Intelligence 93 (1-2):63-101.
    Download  
     
    Export citation  
     
    Bookmark   106 citations  
  • Dialectic proof procedures for assumption-based, admissible argumentation.P. M. Dung, R. A. Kowalski & F. Toni - 2006 - Artificial Intelligence 170 (2):114-159.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Computing ideal sceptical argumentation.P. M. Dung, P. Mancarella & F. Toni - 2007 - Artificial Intelligence 171 (10-15):642-674.
    Download  
     
    Export citation  
     
    Bookmark   62 citations