Sciweavers

462 search results - page 63 / 93
» Preference Reasoning
Sort
View
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
13 years 8 months ago
A sufficient condition for voting rules to be frequently manipulable
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
Lirong Xia, Vincent Conitzer
ICAIL
2009
ACM
13 years 6 months ago
Case law in extended argumentation frameworks
In this paper we discuss how recent developments in argumentation frameworks, most notably Extended Argumentation Frameworks, can inform the representation of a body of case law u...
Trevor J. M. Bench-Capon, Sanjay Modgil
FI
2011
146views more  FI 2011»
13 years 3 months ago
A Service Oriented Architecture for Personalized Universal Media Access
: Multimedia streaming means delivering continuous data to a plethora of client devices. Besides the actual data transport, this also needs a high degree of content adaptation resp...
Sascha Tönnies, Benjamin Köhncke, Patric...
SPATIALCOGNITION
2000
Springer
14 years 9 days ago
Interactive Layout Generation with a Diagrammatic Constraint Language
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
Christoph Schlieder, Cornelius Hagen
AAAI
1990
13 years 10 months ago
The Representation of Defaults in Cyc
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
Ramanathan V. Guha