Switch to: References

Add citations

You must login to add citations.
  1. Before and after Dung: Argumentation in AI and Law.T. J. M. Bench-Capon - 2020 - Argument and Computation 11 (1-2):221-238.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Thirty years of Artificial Intelligence and Law: overviews.Michał Araszkiewicz, Trevor Bench-Capon, Enrico Francesconi, Marc Lauritsen & Antonino Rotolo - 2022 - Artificial Intelligence and Law 30 (4):593-610.
    The first issue of _Artificial Intelligence and Law_ journal was published in 1992. This paper discusses several topics that relate more naturally to groups of papers than a single paper published in the journal: ontologies, reasoning about evidence, the various contributions of Douglas Walton, and the practical application of the techniques of AI and Law.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Evidential Reasoning.Marcello Di Bello & Bart Verheij - 2011 - In G. Bongiovanni, Don Postema, A. Rotolo, G. Sartor, C. Valentini & D. Walton (eds.), Handbook in Legal Reasoning and Argumentation. Dordrecht, Netherland: Springer. pp. 447-493.
    The primary aim of this chapter is to explain the nature of evidential reasoning, the characteristic difficulties encountered, and the tools to address these difficulties. Our focus is on evidential reasoning in criminal cases. There is an extensive scholarly literature on these topics, and it is a secondary aim of the chapter to provide readers the means to find their way in historical and ongoing debates.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Analyzing the Simonshaven Case With and Without Probabilities.Bart Verheij - 2020 - Topics in Cognitive Science 12 (4):1175-1199.
    This paper is one in a series of rational analyses of the Dutch Simonshaven case, each using a different theoretical perspective. The theoretical perspectives discussed in the literature typically use arguments, scenarios, and probabilities, in various combinations. The theoretical perspective on evidential reasoning used in this paper has been designed to connect arguments, scenarios, and probabilities in a single formal modeling approach, in an attempt to investigate bridges between qualitative and quantitative analytic styles. The theoretical perspective uses the recently proposed (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Artificial intelligence as law. [REVIEW]Bart Verheij - 2020 - Artificial Intelligence and Law 28 (2):181-206.
    Information technology is so ubiquitous and AI’s progress so inspiring that also legal professionals experience its benefits and have high expectations. At the same time, the powers of AI have been rising so strongly that it is no longer obvious that AI applications (whether in the law or elsewhere) help promoting a good society; in fact they are sometimes harmful. Hence many argue that safeguards are needed for AI to be trustworthy, social, responsible, humane, ethical. In short: AI should be (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Narration in judiciary fact-finding: a probabilistic explication.Rafal Urbaniak - 2018 - Artificial Intelligence and Law 26 (4):345-376.
    Legal probabilism is the view that juridical fact-finding should be modeled using Bayesian methods. One of the alternatives to it is the narration view, according to which instead we should conceptualize the process in terms of competing narrations of what happened. The goal of this paper is to develop a reconciliatory account, on which the narration view is construed from the Bayesian perspective within the framework of formal Bayesian epistemology.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • On searching explanatory argumentation graphs.Régis Riveret - 2020 - Journal of Applied Non-Classical Logics 30 (2):123-192.
    Cases or examples can be often explained by the interplay of arguments in favour or against their outcomes. This paper addresses the problem of finding explanations for a collection of cases where an explanation is a labelled argumentation graph consistent with the cases, and a case is represented as a statement labelling. The focus is on semi-abstract argumentation graphs specifying attack and subargument relations between arguments, along with particular complete argument labellings taken from probabilistic argumentation where arguments can be excluded. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Modelling competing legal arguments using Bayesian model comparison and averaging.Martin Neil, Norman Fenton, David Lagnado & Richard David Gill - 2019 - Artificial Intelligence and Law 27 (4):403-430.
    Bayesian models of legal arguments generally aim to produce a single integrated model, combining each of the legal arguments under consideration. This combined approach implicitly assumes that variables and their relationships can be represented without any contradiction or misalignment, and in a way that makes sense with respect to the competing argument narratives. This paper describes a novel approach to compare and ‘average’ Bayesian models of legal arguments that have been built independently and with no attempt to make them consistent (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • A system of communication rules for justifying and explaining beliefs about facts in civil trials.João Marques Martins - 2020 - Artificial Intelligence and Law 28 (1):135-150.
    This paper addresses the problems of justifying and explaining beliefs about facts in the context of civil trials. The first section contains some remarks about the nature of adjudicative fact-finding and highlights the communicative features of deciding about facts in judicial context. In Sect. 2, some difficulties and the incompleteness presented by Bayesian and coherentist frameworks, which are taken as methods suitable to solve the above-mentioned problems, are pointed out. In the third section, the purely epistemic approach to the justification (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Measuring coherence with Bayesian networks.Alicja Kowalewska & Rafal Urbaniak - 2023 - Artificial Intelligence and Law 31 (2):369-395.
    When we talk about the coherence of a story, we seem to think of how well its individual pieces fit together—how to explicate this notion formally, though? We develop a Bayesian network based coherence measure with implementation in _R_, which performs better than its purely probabilistic predecessors. The novelty is that by paying attention to the network structure, we avoid simply taking mean confirmation scores between all possible pairs of subsets of a narration. Moreover, we assign special importance to the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • GORGIAS: Applying argumentation.Antonis C. Kakas, Pavlos Moraitis & Nikolaos I. Spanoudakis - 2018 - Argument and Computation 10 (1):55-81.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Towards a framework for computational persuasion with applications in behaviour change1.Anthony Hunter - 2018 - Argument and Computation 9 (1):15-40.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Syntactic reasoning with conditional probabilities in deductive argumentation.Anthony Hunter & Nico Potyka - 2023 - Artificial Intelligence 321 (C):103934.
    Download  
     
    Export citation  
     
    Bookmark  
  • Defeasible reasoning.Robert C. Koons - 2008 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Generalized logical operations among conditional events.Angelo Gilio & Giuseppe Sanfilippo - 2019 - Applied Intelligence 49:79-102.
    We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations