Sciweavers

2303 search results - page 222 / 461
» On the logic of argumentation theory
Sort
View
ICFP
2006
ACM
16 years 6 months ago
A pattern for almost compositional functions
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
Aarne Ranta, Björn Bringert
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 4 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
FOCS
1999
IEEE
15 years 11 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
AAAI
2007
15 years 9 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
SLOGICA
2008
97views more  SLOGICA 2008»
15 years 6 months ago
A Generic Framework for Adaptive Vague Logics
A generic format for adaptive vague logics is presented. The concrete adaptive vague logics based on this format are able to (1) identify sentences as vague or non-vague in the con...
Peter Verdée, Stephan van der Waart van Gul...