Sciweavers

2436 search results - page 55 / 488
» Comonadic Notions of Computation
Sort
View
COMMA
2010
13 years 4 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...
COMMA
2010
13 years 4 months ago
Dialectical Proofs for Constrained Argumentation
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
Caroline Devred, Sylvie Doutre, Claire Lefè...
JAIR
2011
72views more  JAIR 2011»
13 years 4 months ago
A Logical Study of Partial Entailment
We introduce a novel logical notion–partial entailment–to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with...
Y. Zhou, Y. Zhang
CHI
2002
ACM
14 years 10 months ago
The philosophy and design of socially adept technologies
Context-aware artifacts can be seen as an important class of socially adept technologies. In this paper, we focus on the fact that disregarding trivial notions of context, context...
Stephen Marsh, Lucy T. Nowell, John F. Meech, Kers...
RECOMB
2002
Springer
14 years 10 months ago
Finding motifs in the twilight zone
We introduce the notion of a multiprofile and use it for finding subtle motifs in DNA sequences. Multiprofiles generalize the notion of a profile and allow one to detect subtle co...
Uri Keich, Pavel A. Pevzner