The Metis research project aims at supporting maritime safety and security by facilitating continuous monitoring of vessels in national coastal waters and prevention of phenomena, such as vessel collisions, environmental hazard, or detection of malicious intents, such as smuggling. Surveillance systems such as Metis typically comprise a number of heterogeneous information sources and information aggregators. Among the main problems of their deployment lies their scalability with respect to a potentially large number of monitored entities. One of the solutions to the (...) problem is continuous and timely adaptation and reconfiguration of the system according to the changing environment it operates in. At any given timepoint, the system should use only a minimal set of information sources and aggregators needed to facilitate effective and early detection of indicators of interest. Here, we describe the Metis system prototype and introduce a theoretical framework for modelling scalable information-aggregation sys.. (shrink)

In this essay, Weinstein wants to address the issue of argument strength, of how strongly the premises of an argument support a conclusion. Using the framework of the Toulmin model, arguments have warrants which indicate some general connection between the premises and the conclusion of the argument. We may ask for the backing of the warrant, evidence for it. If the connection is an empirical generalization, the backing includes data supporting the generalization. But the backing may include theoretical generalizations, which (...) may explain the warrant. Furthermore, theories may be reduced by more comprehensive theories. A warrant then may ultimately be backed by some deep and very comprehensive theoretical explanation.Weinstein seeks to explicate the relation between the depth of backing for the warrant and the strength of the connection between premises and conclusion which the warrant indicates through the Model of Emerging Truth . Data relevant to confirming the theory have empir .. (shrink)

This paper investigates when two abstract logic-based argumentation systems are equivalent. It defines various equivalence criteria, investigates the links between them, and identifies cases where two systems are equivalent with respect to each of the proposed criteria. In particular, it shows that under some reasonable conditions on the logic underlying an argumentation system, the latter has an equivalent finite subsystem, called core. This core constitutes a threshold under which arguments of the system have not yet attained their final status and (...) consequently adding a new argument may result in status change. From that threshold, the statuses of all arguments become stable. (shrink)

Selinger provides a new take on what is being referred to in the computational literature as ‘structured argumentation’. In this commentary the differences and similarities with existing work are highlighted as a way of demonstrating how philosophical and computational approaches to argumentation are increasingly coming together and complementing one another.

The aim of this paper is to propose foundations for a formal model of representation and numerical evaluation of a possibly broad class of arguments, including those that occur in natural discourse. Since one of the most characteristic features of everyday argumentation is the occurrence of convergent reasoning, special attention should be paid to the operation ⊕, which allows us to calculate the logical force of convergent arguments with an accuracy not offered by other approaches.

Trust is a natural mechanism by which an autonomous party, an agent, can deal with the inherent uncertainty regarding the behaviours of other parties and the uncertainty in the information it shares with those parties. Trust is thus crucial in any decentralised system. This paper builds on recent efforts to use argumentation to reason about trust. Specifically, a set of schemes is provided, and abstract patterns of reasoning that apply in multiple situations geared towards trust. Schemes are described in which (...) one agent, A, can establish arguments for trusting another agent, B, directly, as well as schemes that A can use to construct arguments for trusting C, where C is trusted by B. For both sets of schemes, a set of critical questions is offered that identify the situations in which these schemes can fail. (shrink)

During a dialogue, agents exchange information with each other and need thus to deal with incoming information. For that purpose, they should be able to reason effectively about trustworthiness of information sources. This paper proposes an argument-based system that allows an agent to reason about its own beliefs and information received from other sources. An agent's beliefs are of two kinds: beliefs about the environment and beliefs about trusting sources . Six basic forms of trust are discussed in the paper (...) including the most common one on sincerity. Starting with a base which contains such information, the system builds two types of arguments: arguments in favour of trusting a given source of information and arguments in favour of believing statements which may be received from other agents. We discuss how the different arguments interact and how an agent may decide to trust another source and thus to accept information coming from that source... (shrink)

This paper outlines an integrated approach to trust and relevance with respect to arguments: in particular, it is suggested that trust in relevance has a central role in argumentation. We first distinguish two types of argumentative relevance: internal relevance, i.e. the extent to which a premise has a bearing on its purported conclusion, and external relevance, i.e. a measure of how much a whole argument is pertinent to the matter under discussion, in the broader dialogical context where it is proposed. (...) Then, we argue that judgements of internal relevance heavily rely on trust, and that such trust, although occasionally misplaced , is nonetheless based on several reasons, and thus often justified, by either epistemic or pragmatic considerations. We conclude by sketching potential methods to formally model trust in argumentative relevance, and briefly discussing the technological implications of this line of research. (shrink)

In this paper, we present a survey of the development of the technique of argument diagramming covering not only the fields in which it originated - informal logic, argumentation theory, evidence law and legal reasoning – but also more recent work in applying and developing it in computer science and artificial intelligence. Beginning with a simple example of an everyday argument, we present an analysis of it visualised as an argument diagram constructed using a software tool. In the context of (...) a brief history of the development of diagramming, it is then shown how argument diagrams have been used to analyze and work with argumentation in law, philosophy and artificial intelligence. (shrink)

This survey is the first to review the combination of computational trust and argumentation. The combination of the two approaches seems like a natural match, with the two areas tackling different aspects of reasoning in an uncertain, social environment. We discuss the different areas of research and describe the approaches taken so far, analysing both how they address the problems and the challenges that are unaddressed.

In the current paper, we re-examine how abstract argumentation can be formulated in terms of labellings, and how the resulting theory can be applied in the field of modal logic. In particular, we are able to express the (complete) extensions of an argumentation framework as models of a set of modal logic formulas that represents the argumentation framework. Using this approach, it becomes possible to define the grounded extension in terms of modal logic entailment.

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 (...) abstract argumentation, we can turn to structured argumentation, which is the topic of this special issue of Argument and Computation. In structured argumentation, we assume a formal language for representing knowledge and specifying how arguments and counterarguments can be constructed from that knowledge. An argument is then said to be structured in the sense that normally, the premises and claim of the argument are made explicit, and the relationship between the premises and claim is formally defined (for instance, using logical entailment). In this introduction, we provide a brief overview of the approaches covered in this special issue on structured argumentation. (shrink)

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 (...) to obtain answers from a knowledge base represented using a logic programming language extended with defeasible rules. This combination of ideas brings about a computationally effective system together with a human-like reasoning model facilitating its use in applications. (shrink)

Mathematicians often speak of conjectures, yet unproved, as probable or well-confirmed by evidence. The Riemann Hypothesis, for example, is widely believed to be almost certainly true. There seems no initial reason to distinguish such probability from the same notion in empirical science. Yet it is hard to see how there could be probabilistic relations between the necessary truths of pure mathematics. The existence of such logical relations, short of certainty, is defended using the theory of logical probability (or objective Bayesianism (...) or non-deductive logic), and some detailed examples of its use in mathematics surveyed. Examples of inductive reasoning in experimental mathematics are given and it is argued that the problem of induction is best appreciated in the mathematical case. (shrink)

Belief merging aims at combining several pieces of information coming from different sources. In this paper we review the works on belief merging of propositional bases. We discuss the relationship between merging, revision, update and confluence, and some links between belief merging and social choice theory. Finally we mention the main generalizations of these works in other logical frameworks.

We present two prudent semantics within Dung's theory of argumentation. They are based on two new notions of extension, referred to as p-extension and c-extension. Two arguments cannot belong to the same p-extension whenever one of them attacks indirectly the other one. Two arguments cannot belong to the same c-extension whenever one of them indirectly attacks a third argument while the other one indirectly defends the third. We argue that our semantics lead to a better handling of controversial arguments than (...) Dung's ones. We compare the prudent inference relations induced by our semantics w.r.t. cautiousness; we also compare them with the inference relations induced by Dung's semantics. (shrink)

The aim of this paper is to provide a model that allows the representation and analysis of circularity in ethotic structures, i.e. in communication structures related to the speaker’s character and in particular, his credibility. The paper studies three types of cycles: in self-referential sentences, embedded testimony and ethotic begging the question. It is shown that standard models allow the reconstruction of the circularities only if those circular utterances are interpreted as ethotic arguments. Their alternative, assertive interpretation requires enriching the (...) existing models with a purely ethotic component related to the credibility of the performer of any (not necessarily argumentative) speech act. (shrink)

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 (...) the paper is that from an argumentation point of view, it is better to critically question arguments from expert opinion than to accept or reject them based solely on trust. (shrink)

A novel normal form for propositional theories underlies the logic pdl, which captures some essential features of natural discourse, independent from any particular subject matter and related only to its referential structure. In particular, pdlallows to distinguish vicious circularity from the innocent one, and to reason in the presence of inconsistency using a minimal number of extraneous assumptions, beyond the classical ones. Several, formally equivalent decision problems are identified as potential applications: non-paradoxical character of discourses, admissibility of arguments in argumentation (...) networks, propositional satisfiability, and the existence of kernels of directed graphs. Directed graphs provide the basis for the semantics of pdl and the paper concludes by an overview of relevant graph-theoretical results and their applications in diagnosing paradoxical character of natural discourses. (shrink)

In this paper, a case study is conducted to test the capability of the Carneades Argumentation System to model the argumentation in a case where forensic evidence was collected in an investigation triggered by a conflict among art experts on the attribution of a painting to Leonardo da Vinci. A claim that a portrait of a young woman in a Renaissance dress could be attributed to da Vinci was initially dismissed by art experts. Forensic investigations were carried out, and evidence (...) was collected by art history experts and scientific experts. The expert opinions were initially in conflict, but new evidence shifted the burden of proof onto the side of the skeptics. This paper presents an analysis of the structure of the interlocking argumentation in the case using argument mapping tools to track the accumulation of evidence pro and con. (shrink)

In this paper we show that some versions of Dung’s abstract argumentation frames are equivalent to classical propositional logic. In fact, Dung’s attack relation is none other than the generalised Peirce–Quine dagger connective of classical logic which can generate the other connectives ${\neg, \wedge, \vee, \to}$ of classical logic. After establishing the above correspondence we offer variations of the Dung argumentation frames in parallel to variations of classical logic, such as resource logics, predicate logic, etc., etc., and create resource argumentation (...) frames, predicate argumentation frames, etc., etc. We also offer the notion of logic proof as a geometrical walk along the nodes of a Dung network and thus we are able to offer a geometrical abstraction of the notion of inference based argumentation. Thus our paper is also a contribution to the question: “What is a logical system” in as much as it integrates logic with abstract argumentation networks. (shrink)

For Tarski logics, there are simple criteria that enable one to conclude that two premise sets are equivalent. We shall show that the very same criteria hold for adaptive logics, which is a major advantage in comparison to other approaches to defeasible reasoning forms. A related property of Tarski logics is that the extensions of equivalent premise sets with the same set of formulas are equivalent premise sets. This does not hold for adaptive logics. However a very similar criterion does. (...) We also shall show that every monotonic logic weaker than an adaptive logic is weaker than the lower limit logic of the adaptive logic or identical to it. This highlights the role of the lower limit for settling the adaptive equivalence of extensions of equivalent premise sets. (shrink)

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 (...) semantics of the system is given with a fixpoint definition, while its proof theory is stated in dialectical style, where a proof takes the form of a dialogue between a proponent and an opponent of an argument: an argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks. (shrink)

The Toulmin diagram layout is very familiar and widely used, particularly in the teaching of critical thinking skills. The conventional box-and-arrow diagram is equally familiar and widespread. Translation between the two throws up a number of interesting challenges. Some of these challenges (such as the relationship between Toulmin warrants and their counterparts in traditional diagrams) represent slightly different ways of looking at old and deep theoretical questions. Others (such as how to allow Toulmin diagrams to be recursive) are diagrammatic versions (...) of questions that have already been addressed in artificial intelligence models of argument. But there are further questions (such as the relationships between refutations, rebuttals and undercutters, and the roles of multiple warrants) that are posed as a specific result of examining the diagram inter-translation problem. These three classes of problems are discussed. To the first class are addressed solutions based on engineering pragmatism; to the second class, are addressed solutions drawn from the appropriate literature; and to the third class, fuller exploration is offered justifying the approaches taken in developing solutions that offer both pragmatic utility and theoretical interest. Finally, these solutions are explored briefly in the context of the Araucaria system, showing the ways in which analysts can tackle arguments either using one diagrammatic style or another, or even a combination of the two. (shrink)

Toulmin’s scheme for the layout of arguments (1958, The Uses of Argument, Cambridge University Press, Cambridge) represents an influential tool for the analysis of arguments. The scheme enriches the traditional premises-conclusion model of arguments by distinguishing additional elements, like warrant, backing and rebuttal. The present paper contains a formal elaboration of Toulmin’s scheme, and extends it with a treatment of the formal evaluation of Toulmin-style arguments, which Toulmin did not discuss at all. Arguments are evaluated in terms of a so-called (...) dialectical interpretation of their assumptions. In such an interpretation, an argument’s assumptions can be evaluated as defeated, e.g., when there is a defeating reason against the assumption. The present work builds on recent research on defeasible argumentation (cf. e.g. the work of Pollock, Reiter, Loui, Vreeswijk, Prakken, Hage and Dung). More specifically, the author’s work on the dialectical logic DEFLOG and the argumentation tool ARGUMED serve as starting points. (shrink)

Mercier & Sperber (M&S) claim that the phenomenon of belief bias provides fundamental support for their argumentative theory and its basis in intuitive judgement. We propose that chronometric evidence necessitates a more nuanced account of belief bias that is not readily captured by argumentative theory.

The biological function of human reasoning abilities cannot be to improve shared knowledge. This is at best a side effect. A more plausible function of argumentation, and thus of reasoning, is to advertise one's ability to detect lies and errors. Such selfish behavior is closer to what we should expect from a naturally selected competence.

Dung’s (1995) argumentation framework takes as input two abstract entities: a set of arguments and a binary relation encoding attacks between these arguments. It returns acceptable sets of arguments, called extensions, w.r.t. a given semantics. While the abstract nature of this setting is seen as a great advantage, it induces a big gap with the application that it is used to. This raises some questions about the compatibility of the setting with a logical formalism (i.e., whether it is possible to (...) instantiate it properly from a logical knowledge base), and about the significance of the various semantics in the application context. In this paper we tackle the above questions. We first propose to fill in the previous gap by extending Dung’s (1995) framework. The idea is to consider all the ingredients involved in an argumentation process. We start with the notion of an abstract monotonic logic which consists of a language (defining the formulas) and a consequence operator. We show how to build, in a systematic way, arguments from a knowledge base formalised in such a logic. We then recall some basic postulates that any instantiation should satisfy. We study how to choose an attack relation so that the instantiation satisfies the postulates. We show that symmetric attack relations are generally not suitable. However, we identify at least one ‘appropriate’ attack relation. Next, we investigate under stable, semi-stable, preferred, grounded and ideal semantics the outputs of logic-based instantiations that satisfy the postulates. For each semantics, we delimit the number of extensions an argumentation system may have, characterise the extensions in terms of subsets of the knowledge base, and finally characterise the set of conclusions that are drawn from the knowledge base. The study reveals that stable, semi-stable and preferred semantics either lead to counter-intuitive results or provide no added value w.r.t. naive semantics. Besides, naive semantics either leads to arbitrary results or generalises the coherence-based approach initially developed by Rescher and Manor (1970). Ideal and grounded semantics either coincide and generalise the free consequence relation developed by Benferhat, Dubois, and Prade (1997), or return arbitrary results. Consequently, Dung’s (1995) framework seems problematic when applied over deductive logical formalisms. (shrink)

In studies of multi-agent interaction, especially in game theory, the notion of equilibrium often plays a prominent role. A typical scenario for the belief merging problem is one in which several agents pool their beliefs together to form a consistent "group" picture of the world. The aim of this paper is to define and study new notions of equilibria in belief merging. To do so, we assume the agents arrive at consistency via the use of a social belief removal function, (...) in which each agent, using his own individual removal function, removes some belief from his stock of beliefs. We examine several notions of equilibria in this setting, assuming a general framework for individual belief removal due to Booth et al. We look at their inter-relations as well as prove their existence or otherwise. We also show how our equilibria can be seen as a generalisation of the idea of taking maximal consistent subsets of agents. (shrink)

In this paper, we introduce the methodology and techniques of metaargumentation to model argumentation. The methodology of meta-argumentation instantiates Dung's abstract argumentation theory with an extended argumentation theory, and is thus based on a combination of the methodology of instantiating abstract arguments, and the methodology of extending Dung's basic argumentation frameworks with other relations among abstract arguments. The technique of meta-argumentation applies Dung's theory of abstract argumentation to itself, by instantiating Dung's abstract arguments with meta-arguments using a technique called flattening. (...) We characterize the domain of instantiation using a representation technique based on soundness and completeness. Finally, we distinguish among various instantiations using the technique of specification languages. (shrink)

argumentation has been shown to be a powerful tool within many fields such as artificial intelligence, logic and legal reasoning. In this paper we enhance Dung’s well-known abstract argumentation framework with explanatory capabilities. We show that an explanatory argumentation framework (EAF) obtained in this way is a useful tool for the modeling of scientific debates. On the one hand, EAFs allow for the representation of explanatory and justificatory arguments constituting rivaling scientific views. On the other hand, different procedures for selecting (...) arguments, corresponding to different methodological and epistemic requirements of theory evaluation, can be formulated in view of our framework. (shrink)

Everyday life reasoning and argumentation is defeasible and uncertain. I present a probability logic framework to rationally reconstruct everyday life reasoning and argumentation. Coherence in the sense of de Finetti is used as the basic rationality norm. I discuss two basic classes of approaches to construct measures of argument strength. The first class imposes a probabilistic relation between the premises and the conclusion. The second class imposes a deductive relation. I argue for the second class, as the first class is (...) problematic if the arguments involve conditionals. I present a measure of argument strength that allows for dealing explicitly with uncertain conditionals in the premise set. (shrink)

By means of multi-agent simulations, it investigates the truth and consensus-conduciveness of controversial debates. The book brings together research in formal epistemology and argumentation theory.

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. (...) Our approach allows the burden of proof for a premise to be assigned to a different party than the one who has the burden of proving the conclusion of the argument, and also to change the burden of proof or applicable proof standard as the dialogue progresses from stage to stage. Useful for modeling legal dialogues, the burden of production and burden of persuasion can be handled separately, with a different responsible party and applicable proof standard for each. Carneades enables critical questions of argumentation schemes to be modeled as additional premises, using premise types to capture the varying effect on the burden of proof of different kinds of questions. (shrink)

Inspired by some logical considerations, the paper proposes a novel perspective on the use of two-players zero-sum games in abstract argumentation. The paper first introduces a second-order modal logic, within which all main Dung-style semantics are shown to be formalizable, and then studies the model checking game of this logic. The model checking game is then used to provide a systematic game theoretic proof procedure to test membership with respect to all those semantics formalizable in the logic. The paper discusses (...) this idea in detail and illustrates it by providing a game for the so-called skeptical preferred and skeptical semi-stable semantics. (shrink)

In this paper we describe an approach to practical reasoning, reasoning about what it is best for a particular agent to do in a given situation, based on presumptive justifications of action through the instantiation of an argument scheme, which is then subject to examination through a series of critical questions. We identify three particular aspects of practical reasoning which distinguish it from theoretical reasoning. We next provide an argument scheme and an associated set of critical questions which is able (...) to capture these features. In order that both the argument scheme and the critical questions can be given precise interpretations we use the semantic structure of an Action-Based Alternating Transition System as the basis for their definition. We then work through a detailed example to show how this approach to practical reasoning can be applied to a problem solving situation, and briefly describe some other previous applications of the general approach. In a second example we relate our account to the social laws paradigm for co-ordinating multi-agent systems. The contribution of the paper is to provide firm foundations for an approach to practical reasoning based on presumptive argument in terms of a well-known model for representing the effects of actions of a group of agents. (shrink)

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, (...) and the social values which justify those rules. Having given our view of these relationships, we present our formal model of them, and explain how theories can be constructed, compared and evaluated. We then show how previous work can be described in terms of our model, and discuss extensions to the basic model to accommodate particular features of previous work. We conclude by identifying some directions for future work. (shrink)

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 (...) a history of the last quarter century of the field, and provide some insights into where it has come from, where it is now, and where it might go. (shrink)

In this paper, we continue our research on a hybrid narrative-argumentative approach to evidential reasoning in the law by showing the interaction between factual reasoning (providing a proof for ‘what happened’ in a case) and legal reasoning (making a decision based on the proof). First we extend the hybrid theory by making the connection with reasoning towards legal consequences. We then emphasise the role of legal stories (as opposed to the factual stories of the hybrid theory). Legal stories provide a (...) coherent, holistic legal perspective on a case. They steer what needs to be proven but are also selected on the basis of what can be proven. We show how these legal stories can be used to model a shift of the legal perspective on a case, and we discuss how gaps in a legal story can be filled using a factual story (i.e. the process of reasoning with circumstantial evidence). Our model is illustrated by a discussion of the Dutch Wamel murder case. (shrink)

Carneades is an open source argument mapping application and a programming library for building argumentation support tools. In this paper, Carneades’ support for argument reconstruction, evaluation and visualization is illustrated by modeling most of the factual and legal arguments in Popov v Hayashi.

Bayesian networks (BN) and argumentation diagrams (AD) are two predominant approaches to legal evidential reasoning, that are often treated as alternatives to one another. This paper argues that they are, instead, complimentary and proposes the beginnings of a method to employ them in such a manner. The Bayesian approach tends to be used as a means to analyse the findings of forensic scientists. As such, it constitutes a means to perform evidential reasoning. The design of Bayesian networks that accurately and (...) comprehensively represent the relationships between investigative hypotheses and evidence remains difficult and sometimes contentious, however. Argumentation diagrams are representations of reasoning, and are used as a means to scrutinise reasoning (among other applications). In evidential reasoning, they tend to be used to represent and scrutinise the way humans reason about evidence. This paper examines how argumentation diagrams can be used to scrutinise Bayesian evidential reasoning by developing a method to extract argument diagrams from BN. (shrink)

In this article the argumentation structure of the court’s decision in the Popov v. Hayashi case is formalised in Prakken’s (Argument Comput 1:93–124; 2010) abstract framework for argument-based inference with structured arguments. In this framework, arguments are inference trees formed by applying two kinds of inference rules, strict and defeasible rules. Arguments can be attacked in three ways: attacking a premise, attacking a conclusion and attacking an inference. To resolve such conflicts, preferences may be used, which leads to three corresponding (...) kinds of defeat, after which Dung’s (Artif Intell 77:321–357; 1995) abstract acceptability semantics can be used to evaluate the arguments. In the present paper the abstract framework is instantiated with strict inference rules corresponding to first-order logic and with defeasible inference rules for defeasible modus ponens and various argument schemes. The main techniques used in the formal reconstruction of the case are rule-exception structures and arguments about rule validity. Arguments about socio-legal values and the use of precedent cases are reduced to arguments about rule validity. The tree structure of arguments, with explicit subargument relations between arguments, is used to capture the dependency relations between the elements of the court’s decision. (shrink)

This paper proposes an approach to investigate norm-governed learning agents which combines a logic-based formalism with an equation-based counterpart. This dual formalism enables us to describe the reasoning of such agents and their interactions using argumentation, and, at the same time, to capture systemic features using equations. The approach is applied to norm emergence and internalisation in systems of learning agents. The logical formalism is rooted into a probabilistic defeasible logic instantiating Dung’s argumentation framework. Rules of this logic are attached (...) with probabilities to describe the agents’ minds and behaviours as well as uncertain environments. Then, the equation-based model for reinforcement learning, defined over this probability distribution, allows agents to adapt to their environment and self-organise. (shrink)