Sciweavers

8768 search results - page 327 / 1754
» Generalizing the notion of support
Sort
View
IBERAMIA
2010
Springer
15 years 5 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...
215
Voted
ICCBR
2010
Springer
15 years 5 months ago
Amalgams: A Formal Approach for Combining Multiple Case Solutions
How to reuse or adapt past solutions to new problems is one of the least understood problems in case-based reasoning. In this paper we will focus on the problem of how to combine s...
Santiago Ontañón, Enric Plaza
CORR
2011
Springer
150views Education» more  CORR 2011»
15 years 2 months ago
Asymptotic Enumeration of Non-crossing Partitions on Surfaces
We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface Σ and introduce the number CΣ(n) of noncrossing pa...
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilik...
226
Voted
COMMA
2010
15 years 2 months ago
A characterization of collective conflict for defeasible argumentation
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...
Teresa Alsinet, Ramón Béjar, Lluis G...
202
Voted
CCS
2009
ACM
16 years 8 months ago
A generic construction of useful client puzzles
Denial of Service (DoS) attacks are serious threats for network societies. For dealing with DoS attacks, Jakobsson and Juels first proposed the notion of useful client puzzles (UC...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai