Sciweavers

4978 search results - page 29 / 996
» Logical models of argument
Sort
View
ENTCS
2002
157views more  ENTCS 2002»
13 years 8 months ago
Arguments and Misunderstandings: Fuzzy Unification for Negotiating Agents
In this paper, we develop the notion of fuzzy unification and incorporate it into a novel fuzzy argumentation framework for extended logic programming. We make the following contri...
Michael Schroeder, Ralf Schweimeier
IBERAMIA
2010
Springer
13 years 6 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
KR
2004
Springer
14 years 2 months ago
Reaching Agreement Through Argumentation: A Possibilistic Approach
Negotiation plays a key role as a means for sharing information and resources with the aim of looking for a common agreement. This paper proposes a new approach based on possibili...
Leila Amgoud, Henri Prade
HASKELL
2006
ACM
14 years 2 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
COMMA
2006
13 years 10 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