423 research outputs found
More on presumptions and burdens of proof
This paper extends our previous logical analysis of presumptions and burden of proof by studying the force of a presumption once counterevidence has been offered. In the jurisprudential literature different accounts of this issue have been given: some have argued that a presumption is nullified by counterarguments while others have maintained that this gives presumptions a force that is too slight. We argue that these differences largely are not a matter of logic but of legal policy, and we show how the various accounts can be logically formalised
Formalising arguments about the burden of persuasion.
This paper presents an argument-based logic for reasoning about allocations of the burden of persuasion. The logic extends the system of Prakken (2001), which in turn modified the system of Prakken & Sartor (1996) with the possibility to distribute the burden of proof over both sides in an argument game. First the (2001) system is put in the context of a distinction of three types of proof burdens and it is argued that the proof burdens of that system are in fact burdens of persuasion. Then the (2001) system is modified to allow for defeasible reasoning about allocations of such burdens within the logic. The usefulness of the resulting system is illustrated with applications to real legal cases
Analysis of Dialogical Argumentation via Finite State Machines
Dialogical argumentation is an important cognitive activity by which agents
exchange arguments and counterarguments as part of some process such as
discussion, debate, persuasion and negotiation. Whilst numerous formal systems
have been proposed, there is a lack of frameworks for implementing and
evaluating these proposals. First-order executable logic has been proposed as a
general framework for specifying and analysing dialogical argumentation. In
this paper, we investigate how we can implement systems for dialogical
argumentation using propositional executable logic. Our approach is to present
and evaluate an algorithm that generates a finite state machine that reflects a
propositional executable logic specification for a dialogical argumentation
together with an initial state. We also consider how the finite state machines
can be analysed, with the minimax strategy being used as an illustration of the
kinds of empirical analysis that can be undertaken.Comment: 10 page
Changing legal systems: Abrogation and annulment. Part I: Revision of defeasible theories
In this paper we investigate how to model legal abrogation and annulment in Defeasible Logic. We examine some options that embed in this setting, and similar rule-based systems, ideas from belief and base revision. In both cases, our conclusion is negative, which suggests to adopt a different logical model
Settling on the group's goals: An n-person argumentation game approach
Argumentation games have been proved to be a robust and flexible tool to resolve conflicts among agents. An agent can propose its explanation and its goal known as a claim, which can be refuted by other agents. The situation is more complicated when there are more than two agents playing the game. We propose a weighting mechanism for competing premises to tackle with conflicts from multiple agents in an n-person game. An agent can defend its proposal by giving a counter-argument to change the ``opinion'' of the majority of opposing agents. During the game, an agent can exploit the knowledge that other agents expose in order to promote and defend its main claim
- …