Sciweavers

1707 search results - page 6 / 342
» A Computational Model for Arguments Understanding
Sort
View
COMMA
2008
14 years 11 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...
AUSAI
2005
Springer
15 years 3 months ago
Structure-Based Algorithms for Computing Preferred Arguments of Defeasible Knowledge Bases
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...
Quoc Bao Vo
ACL
2009
14 years 7 months ago
Discriminative Approach to Predicate-Argument Structure Analysis with Zero-Anaphora Resolution
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 ...
Kenji Imamura, Kuniko Saito, Tomoko Izumi
FOIKS
2008
Springer
14 years 11 months ago
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
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...
Vasiliki Efstathiou, Anthony Hunter
AIR
2010
95views more  AIR 2010»
14 years 9 months ago
A taxonomy of argumentation models used for knowledge representation
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 ...
Jamal Bentahar, Bernard Moulin, Micheline Bé...