AbstractThe purpose of this paper is to present new computational techniques for probabilistic argumentation systems. It shows that instead of computing intractable large sets of arguments, it is also possible to find good approximations of the exact solutions in reasonable time. The technique presented is based on cost functions, which are used to measure the relevance of arguments
Combining computational models of argumentation with probability theory has recently gained increasi...
While in principle probabilistic logics might be applied to solve a range of problems, in practice t...
Probabilistic epistemic argumentation allows for reasoning about argumentation problems in a way tha...
AbstractThe purpose of this paper is to present new computational techniques for probabilistic argum...
AbstractArgumentation in the sense of a process of logical reasoning is a very intuitive and general...
In this paper, we extend Dung's seminal argument framework to form a probabilistic argument framewor...
Argumentation is a vital aspect of intelligent behaviour by humans. It provides the means for compar...
Argumentation systems permit to nd arguments in favour and against hypotheses. And these hypotheses ...
There is a generic way to add any new feature to a system. It involves 1) identifying the basic uni...
In this paper we analyze probabilistic argumentation frameworks (PAFs), defined as an extension of D...
peer reviewedThere is a generic way to add any new feature to a system. It involves (1) identifying ...
Qualitative and quantitative systems to deal with uncertainty coexist. Bayesian networks are a well ...
AbstractProbability is usually closely related to Boolean structures, i.e., Boolean algebras or prop...
When informal arguments are presented, there may be imprecision in the language used, and so the au...
peer reviewedIn this paper we introduce a new set of general principles for probabilistic abstract a...
Combining computational models of argumentation with probability theory has recently gained increasi...
While in principle probabilistic logics might be applied to solve a range of problems, in practice t...
Probabilistic epistemic argumentation allows for reasoning about argumentation problems in a way tha...
AbstractThe purpose of this paper is to present new computational techniques for probabilistic argum...
AbstractArgumentation in the sense of a process of logical reasoning is a very intuitive and general...
In this paper, we extend Dung's seminal argument framework to form a probabilistic argument framewor...
Argumentation is a vital aspect of intelligent behaviour by humans. It provides the means for compar...
Argumentation systems permit to nd arguments in favour and against hypotheses. And these hypotheses ...
There is a generic way to add any new feature to a system. It involves 1) identifying the basic uni...
In this paper we analyze probabilistic argumentation frameworks (PAFs), defined as an extension of D...
peer reviewedThere is a generic way to add any new feature to a system. It involves (1) identifying ...
Qualitative and quantitative systems to deal with uncertainty coexist. Bayesian networks are a well ...
AbstractProbability is usually closely related to Boolean structures, i.e., Boolean algebras or prop...
When informal arguments are presented, there may be imprecision in the language used, and so the au...
peer reviewedIn this paper we introduce a new set of general principles for probabilistic abstract a...
Combining computational models of argumentation with probability theory has recently gained increasi...
While in principle probabilistic logics might be applied to solve a range of problems, in practice t...
Probabilistic epistemic argumentation allows for reasoning about argumentation problems in a way tha...
DOI
Add to ORKG