- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
Add citations
You must login to add citations.
|
|
|
In the current paper we re-examine the concepts of attack semantics and collective attacks in abstract argumentation, and examine how these concepts interact with each other. For this, we systematically map the space of possibilities. Starting with standard argumentation frameworks (which consist of a directed graph with nodes and arrows) we briefly state both node semantics and arrow semantics (the latter a.k.a. attack semantics) in both their extensions-based form and labellings-based form. We then proceed with SETAFs (which consist of a (...) |
|
|
|
|
|
|
|
|
This paper builds a nine-step method for determining whether a straw man fallacy has been committed in a given case or not, by starting with some relatively easy textbook cases and moving to more realistic and harder cases. The paper shows how the type of argument associated with the fallacy can be proved to be a fallacy in a normative argumentation model, and then moves on to the practical task of building a hands-on method for applying the model to real (...) |
|
|
Revision operation is the consistent expansion of a theory by a new belief-representing sentence. We consider that in a paraconsistent setting this desideratum can be accomplished in at least three distinct ways: the output of a revision operation should be either non-trivial or non-contradictory (in general or relative to the new belief). In this paper those distinctions will be explored in the constructive level by showing how the remainder sets could be refined, capturing the key concepts of paraconsistency in a (...) |
|
|
This paper overviews some recent work on the semantics and pragmatics of arguments. |
|
|
In the 1980s, Pollock’s work on default reasons started the quest in the AI community for a formal system of defeasible argumentation. The main goal of this paper is to provide a logic of structured defeasible arguments using the language of justification logic. In this logic, we introduce defeasible justification assertions of the type t : F that read as “t is a defeasible reason that justifies F”. Such formulas are then interpreted as arguments and their acceptance semantics is given (...) |
|
|
This chapter proposes a dialectical approach to legal interpretation, consisting of three dimensions: a formalization of the canons of interpretation in terms of argumentation schemes; a dialectical classification of interpretive schemes; and a logical and computational model for comparing the arguments pro and contra an interpretation. The traditional interpretive maxims or canons used in both common and civil law are translated into defeasible patterns of arguments, which can be evaluated through sets of corresponding critical questions. These interpretive argumentation schemes are (...) |
|
|
The article develops and justifies, on the basis of the epistemological argumentation theory, two central pieces of the theory of evaluative argumentation interpretation: 1. criteria for recognizing argument types and 2. rules for adding reasons to create ideal arguments. Ad 1: The criteria for identifying argument types are a selection of essential elements from the definitions of the respective argument types. Ad 2: After presenting the general principles for adding reasons (benevolence, authenticity, immanence, optimization), heuristics are proposed for finding missing (...) |
|
|
This paper combines methods of argumentation theory and artificial intelligence to extend existing work on the dialectical structure of crossexamination. The existing method used conflict diagrams to search for inconsistent statements in the testimony of a witness. This paper extends the method by using the inconsistency of commitments to draw an inference by the ad hominem argumentation scheme to the conclusion that the testimony is unreliable because of the bad ethical character for veracity of the witness. |
|
|
We present a high-level declarative programming language for representing argumentation schemes, where schemes represented in this language can be easily validated by domain experts, including developers of argumentation schemes in informal logic and philosophy, and serve as executable specifications for automatically constructing arguments, when applied to a set of assumptions. This new rule language for representing argumentation schemes is validated by using it to represent twenty representative argumentation schemes. |
|
|
This paper proposes an argumentation-based procedure for legal interpretation, by reinterpreting the traditional canons of textual interpretation in terms of argumentation schemes, which are then classified, formalized, and represented through argument visualization and evaluation tools. The problem of statutory interpretation is framed as one of weighing contested interpretations as pro and con arguments. The paper builds an interpretation procedure by formulating a set of argumentation schemes that can be used to comparatively evaluate the types of arguments used in cases of (...) |
|
|
The classification of a state of affairs under a legal category can be considered as a kind of con- densed decision that can be made explicit, analyzed, and assessed us- ing argumentation schemes. In this paper, the controversial conflict of opinions concerning the nature of “marriage” in Obergefell v. Hodges is analyzed pointing out the dialecti- cal strategies used for addressing the interpretive doubts. The dispute about the same-sex couples’ right to marry hides a much deeper disa- greement not only (...) |
|
|
In this paper, I propose a logical-cognitive approach to argumentation and advocate an idea that argumentation presupposes that intelligent agents engaged in it are cognitively diverse. My approach to argumentation allows drawing distinctions between justification, conviction and persuasion as its different kinds. In justification agents seek to verify weak or strong coherency of an agent’s position in a dialogue. In conviction they argue to modify their partner’s position by means of demonstrating weak or strong cogency of their positions before a (...) |
|
|
|
|
|
This paper presents a formalization of informal logic using the Carneades Argumentation System, a formal, computational model of argument that consists of a formal model of argument graphs and audiences. Conflicts between pro and con arguments are resolved using proof standards, such as preponderance of the evidence. Carneades also formalizes argumentation schemes. Schemes can be used to check whether a given argument instantiates the types of argument deemed normatively appropriate for the type of dialogue. |
|
|
This paper presents a dialogue system called Lorenzen–Hamblin Natural Dialogue (LHND), in which participants can commit formal fallacies and have a method of both identifying and withdrawing formal fallacies. It therefore provides a tool for the dialectical evaluation of force of argument when players advance reasons which are deductively incorrect. The system is inspired by Hamblin’s formal dialectic and Lorenzen’s dialogical logic. It offers uniform protocols for Hamblin’s and Lorenzen’s dialogues and adds a protocol for embedding them. This unification required (...) |
|
|
In abstract argumentation, each argument is regarded as atomic. There is no internal structure to an argument. Also, there is no specification of what is an argument or an attack. They are assumed to be given. This abstract perspective provides many advantages for studying the nature of argumentation, but it does not cover all our needs for understanding argumentation or for building tools for supporting or undertaking argumentation. If we want a more detailed formalization of arguments than is available with (...) |
|
|
This paper takes an argumentation approach to find the place of trust in a method for evaluating arguments from expert opinion. The method uses the argumentation scheme for argument from expert opinion along with its matching set of critical questions. It shows how to use this scheme in three formal computational argumentation models that provide tools to analyse and evaluate instances of argument from expert opinion. The paper uses several examples to illustrate the use of these tools. A conclusion of (...) |
|
|
We provide a retrospective of 25 years of the International Conference on AI and Law, which was first held in 1987. Fifty papers have been selected from the thirteen conferences and each of them is described in a short subsection individually written by one of the 24 authors. These subsections attempt to place the paper discussed in the context of the development of AI and Law, while often offering some personal reactions and reflections. As a whole, the subsections build into (...) |
|
|
This paper presents a theory of reasoning with evidence in order to determine the facts in a criminal case. The focus is on the process of proof, in which the facts of the case are determined, rather than on related legal issues, such as the admissibility of evidence. In the literature, two approaches to reasoning with evidence can be distinguished, one argument-based and one story-based. In an argument-based approach to reasoning with evidence, the reasons for and against the occurrence of (...) |
|
|
The term "non-monotonic logic" covers a family of formal frameworks devised to capture and represent defeasible inference , i.e., that kind of inference of everyday life in which reasoners draw conclusions tentatively, reserving the right to retract them in the light of further information. Such inferences are called "non-monotonic" because the set of conclusions warranted on the basis of a given knowledge base does not increase (in fact, it can shrink) with the size of the knowledge base itself. This is (...) |
|
|
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 (...) |
|
|
While agent-based modelling languages naturally implement concurrency, the currently available languages for argumentation do not allow to explicitly model this type of interaction. In this paper we introduce a concurrent language for handling agents arguing and communicating using a shared argumentation space. We also show how to perform high-level operations like persuasion and negotiation through basic belief revision constructs, and present a working implementation of the language and the associated web interface. |
|
|
The first issue of _Artificial Intelligence and Law_ journal was published in 1992. This paper provides commentaries on landmark papers from the first decade of that journal. The topics discussed include reasoning with cases, argumentation, normative reasoning, dialogue, representing legal knowledge and neural networks. |
|
|
Philosophical Issues, Volume 31, Issue 1, Page 41-65, October 2021. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Doug Walton, who died in January 2020, was a prolific author whose work in informal logic and argumentation had a profound influence on Artificial Intelligence, including Artificial Intelligence and Law. He was also very interested in interdisciplinary work, and a frequent and generous collaborator. In this paper seven leading researchers in AI and Law, all past programme chairs of the International Conference on AI and Law who have worked with him, describe his influence on their work. |
|
|
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. |
|
|
We study instantiated abstract argumentation frames of the form, where is an abstract argumentation frame and where the arguments x of S are instantiated by I as well formed formulas of a well known logic, for example as Boolean formulas or as predicate logic formulas or as modal logic formulas. We use the method of conceptual analysis to derive the properties of our proposed system. We seek to define the notion of complete extensions for such systems and provide algorithms for (...) |
|
|
Even though tools for identifying and analyzing arguments are now in wide use in the field of argumentation studies, so far there is a paucity of resources for evaluating real arguments, aside from using deductive logic or Bayesian rules that apply to inductive arguments. In this paper it is shown that recent developments in artificial intelligence in the area of computational systems for modeling defeasible argumentation reveal a different approach that is currently making interesting progress. It is shown how these (...) |
|
|
This paper studies the use of hypothetical and value-based reasoning in US Supreme-Court cases concerning the United States Fourth Amendment. Drawing upon formal AI & Law models of legal argument a semi-formal reconstruction is given of parts of the Carney case, which has been studied previously in AI & law research on case-based reasoning. As part of the reconstruction, a semi-formal proposal is made for extending the formal AI & Law models with forms of metalevel reasoning in several argument schemes. (...) |
|
|
Argumentation schemes are forms of reasoning that are fallible but correctable within a self-correcting framework. Their use provides a basis for taking rational action or for reasonably accepting a conclusion as a tentative hypothesis, but they are not deductively valid. We argue that teleological reasoning can provide the basis for justifying the use of argument schemes both in monological and dialogical reasoning. We consider how such a teleological justification, besides being inspired by the aim of directing a bounded cognizer to (...) |
|
|
Informal logic is an attempt to develop a logic that can assess and analyze the arguments that occur in natural language discourse. Discussions in the field may address instances of scientific, legal, and other technical forms of reasoning, but the overriding aim has been a comprehensive account of argument that can explain and evaluate the arguments found in discussion, debate and disagreement as they manifest themselves in daily life — in social and political commentary; in news reports and editorials in (...) |
|
|
|
|
|
We live in exciting times for AI and Law: technical developments are moving at a breakneck pace, and at the same time, the call for more robust AI governance and regulation grows stronger. How should we as an AI & Law community navigate these dramatic developments and claims? In this Presidential Address, I present my ideas for a way forward: researching, developing and evaluating real AI systems for the legal field with researchers from AI, Law and beyond. I will demonstrate (...) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Scientific research in the formal sciences comes in multiple degrees of formality: fully formal work; rigorous proofs that practitioners know to be formalizable in principle; and informal work like rough proof sketches and considerations about the advantages and disadvantages of various formal systems. This informal work includes informal and semi-formal debates between formal scientists, e.g. about the acceptability of foundational principles and proposed axiomatizations. In this paper, we propose to use the methodology of structured argumentation theory to produce a formal (...) |
|
|
The paper is motivated by the need of accounting for the practical syllogism as a piece of defeasible reasoning. To meet the need, the paper first refers to ranking theory as an account of defeasible descriptive reasoning. It then argues that two kinds of ought need to be distinguished, purely normative and fact-regarding obligations. It continues arguing that both kinds of ought can be iteratively revised and should hence be represented by ranking functions, too, just as iteratively revisable beliefs. Its (...) |
|
|
|
|
|
This paper presents a methodology to design and implement programs intended to decide cases, described as sets of factors, according to a theory of a particular domain based on a set of precedent cases relating to that domain. We useDialectical Frameworks, a recent development in AI knowledge representation, as the central feature of our design method. ADFs will play a role akin to that played by Entity–Relationship models in the design of database systems. First, we explain how the factor hierarchy (...) |
|
|
In a criminal trial, evidence is used to draw conclusions about what happened concerning a supposed crime. Traditionally, the three main approaches to modeling reasoning with evidence are argumentative, narrative and probabilistic approaches. Integrating these three approaches could arguably enhance the communication between an expert and a judge or jury. In previous work, techniques were proposed to represent narratives in a Bayesian network and to use narratives as a basis for systematizing the construction of a Bayesian network for a legal (...) |
|
|
We introduce a general approach for representing and reasoning with argumentation-based systems. In our framework arguments are represented by Gentzen-style sequents, attacks between arguments are represented by sequent elimination rules, and deductions are made according to Dung-style skeptical or credulous semantics. This framework accommodates different languages and logics in which arguments may be represented, allows for a flexible and simple way of expressing and identifying arguments, supports a variety of attack relations, and is faithful to standard methods of drawing conclusions (...) |
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6f9648bdd6-6d7m4 uwo