Sciweavers

11 search results - page 2 / 3
» Dialectical Proofs for Constrained Argumentation
Sort
View
IJCAI
2007
13 years 7 months ago
A Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks
argumentation frameworks have played a major role as a way of understanding argumentbased inference, resulting in different argumentbased semantics. In order to make such semantic...
Carlos Iván Chesñevar, Guillermo Ric...
COMMA
2006
13 years 6 months ago
The Carneades Argumentation Framework - Using Presumptions and Exceptions to Model Critical Questions
Abstract. In 2005, Gordon and Walton presented initial ideas for a computational model of defeasible argument [12, 26], which builds on and elaborates Walton's theory of argum...
Thomas F. Gordon, Douglas Walton
COMMA
2006
13 years 6 months ago
Combining sceptical epistemic reasoning with credulous practical reasoning
Abstract. This paper proposes an argument-based semantics for combined epistemic and practical reasoning, taking seriously the idea that in certain contexts epistemic reasoning is ...
Henry Prakken
AIL
2008
103views more  AIL 2008»
13 years 5 months ago
A dialogical theory of presumption
The notions of burden of proof and presumption are central to law, but as noted in McCormick on Evidence, they are also the slipperiest of any of the family of legal terms employe...
Douglas Walton
FSTTCS
2009
Springer
14 years 1 days ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi