1707 search results - page 6 / 342 » A Computational Model for Arguments Understanding |
117
click to vote
COMMA
2008
15 years 3 months ago
2008
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
97
Voted
AUSAI
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we present several efficient computational procedures for defeasible reasoning while the plausible and well-defined semantics, viz. preferred models and stable mode...
125
click to vote
ACL
2009
14 years 11 months ago
2009
This paper presents a predicate-argument structure analysis that simultaneously conducts zero-anaphora resolution. By adding noun phrases as candidate arguments that are not only ...
121
Voted
FOIKS
2008
Springer
2008
Springer
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
15 years 3 months ago
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
105
click to vote
AIR
2010
15 years 1 months ago
2010
Understanding argumentation and its role in human reasoning has been a continuous subject of investigation for scholars from the ancient Greek philosophers to current researchers ...