Sciweavers

4978 search results - page 3 / 996
» Logical models of argument
Sort
View
ECSQARU
2005
Springer
14 years 1 months ago
Argument-Based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
Carlos Iván Chesñevar, Guillermo Ric...
ECIR
1998
Springer
13 years 8 months ago
Modeling Information Retrieval with Probabilistic Argumentation Systems
Probabilistic Argumentation Systems (PAS) are a technique for representing uncertainty both symbolically and numerically. It is shown that this technique, which combines symbolic ...
Justin Picard, Rolf Haenni
PRICAI
2000
Springer
13 years 11 months ago
Argumentation Semantics for Defeasible Logics
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the m...
Guido Governatori, Michael J. Maher, Grigoris Anto...
SUM
2010
Springer
13 years 5 months ago
A Formal Analysis of Logic-Based Argumentation Systems
Dung's abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined ...
Leila Amgoud, Philippe Besnard
COMMA
2008
13 years 9 months ago
A Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic Programming
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
Teresa Alsinet, Carlos Iván Chesñeva...