Results 1  10
of
11,435
Coherence in Finite Argument Systems
, 2001
"... Argument Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two important concepts of the acceptability of an argument p in such systems are credulous acceptance to capture the no ..."
Abstract

Cited by 87 (28 self)
 Add to MetaCart
Argument Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two important concepts of the acceptability of an argument p in such systems are credulous acceptance to capture
EndToEnd Arguments In System Design
, 1984
"... This paper presents a design principle that helps guide placement of functions among the modules of a distributed computer system. The principle, called the endtoend argument, suggests that functions placed at low levels of a system may be redundant or of little value when compared with the cost o ..."
Abstract

Cited by 1037 (10 self)
 Add to MetaCart
This paper presents a design principle that helps guide placement of functions among the modules of a distributed computer system. The principle, called the endtoend argument, suggests that functions placed at low levels of a system may be redundant or of little value when compared with the cost
On roundefficient argument systems
 IN PROC. 32ND ICALP (TRACK
, 2005
"... We consider the problem of constructing roundefficient publiccoin argument systems, that is, interactive proof systems that are only computationally sound with a constant number of rounds. We focus on argument systems for NTime(T (n)) where either the communication complexity or the verifier’s r ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We consider the problem of constructing roundefficient publiccoin argument systems, that is, interactive proof systems that are only computationally sound with a constant number of rounds. We focus on argument systems for NTime(T (n)) where either the communication complexity or the verifier’s
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and nperson games
 Artificial Intelligence
, 1995
"... The purpose of this paper is to study the fundamental mechanism humans use in argumentation and its role in different major approaches to commonsense reasoning in AI and logic programming. We present three novel results: We develop a theory for argumentation in which the acceptability of arguments i ..."
P.: Merging argumentation systems
 In: AAAI 2005
, 2005
"... In this paper, we address the problem of deriving sensible information from a collection of argumentation systems coming from different agents. A general framework for merging argumentation systems from Dung’s theory of argumentation is presented. Each argumentation system gives both a set of arg ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In this paper, we address the problem of deriving sensible information from a collection of argumentation systems coming from different agents. A general framework for merging argumentation systems from Dung’s theory of argumentation is presented. Each argumentation system gives both a set of arguments
Gradual acceptability in argumentation systems
 In Proc. of the 3 rd CMNA (International workshop on computational models of natural argument
"... The argumentation is based on exchange and valuation of arguments interacting, then on the definition of accepted arguments (or sets of arguments) w.r.t. the proposed valuation. In this paper, using the argumentation system of [Dun95] and the valuations proposed in [CLS02a], we introduce graduality ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
The argumentation is based on exchange and valuation of arguments interacting, then on the definition of accepted arguments (or sets of arguments) w.r.t. the proposed valuation. In this paper, using the argumentation system of [Dun95] and the valuations proposed in [CLS02a], we introduce graduality
Probabilistic argumentation systems
 Handbook of Defeasible Reasoning and Uncertainty Management Systems, Volume 5: Algorithms for Uncertainty and Defeasible Reasoning
, 2000
"... Different formalisms for solving problems of inference under uncertainty have been developed so far. The most popular numerical approach is the theory of Bayesian inference [42]. More general approaches are the DempsterShafer theory of evidence [51], and possibility theory [16], which is closely re ..."
Dialogue Requirements for Argumentation Systems
, 1999
"... We consider the requirements of an ideal automated argumentation system designed to model human interactions and compare them with the capabilities of our argumentation system, NAG. We ground our discussion with a description of NAG's architecture, particularly emphasizing NAG's knowle ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the requirements of an ideal automated argumentation system designed to model human interactions and compare them with the capabilities of our argumentation system, NAG. We ground our discussion with a description of NAG's architecture, particularly emphasizing NAG
Probabilistic argumentation systems and abduction
 Annals of Mathematics and Artificial Intelligence
, 2000
"... Probabilistic argumentation systems are based on assumptionbased reasoning for obtaining arguments supporting hypotheses and on probability theory to compute probabilities of supports. Assumptionbased reasoning is closely related to hypothetical reasoning or inference through theory formation. The ..."
Abstract

Cited by 24 (10 self)
 Add to MetaCart
Probabilistic argumentation systems are based on assumptionbased reasoning for obtaining arguments supporting hypotheses and on probability theory to compute probabilities of supports. Assumptionbased reasoning is closely related to hypothetical reasoning or inference through theory formation
An Alternative Semantics for Argumentative Systems
, 2006
"... Defeasible argumentation is one of the approaches that addresses the challenges arising when we reason defeasibly, with several formalisms in the literature reaching a mature state. Considering that most of these theories eventually shifted their semantics towards dialectical characterizations, we b ..."
Abstract
 Add to MetaCart
believe that a sufficiently generic model of the process of reasoning in dialectical terms could also serve as an abstract model of what happens inside an argumentative system. To that end, we develop in this article a formal model of dialectical reasoning and explore its role as an alternative semantics
Results 1  10
of
11,435