Sciweavers

3229 search results - page 321 / 646
» Theories with the Independence Property
Sort
View
LPNMR
2009
Springer
16 years 1 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
SAGT
2009
Springer
177views Game Theory» more  SAGT 2009»
16 years 1 months ago
Characterizing Incentive Compatibility for Convex Valuations
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
André Berger, Rudolf Müller, Seyed Hos...
IAT
2008
IEEE
16 years 1 months ago
Characterizing the Outcomes of Argumentation-Based Integrative Negotiation
In the negotiation literature we find two relatively distinct types of negotiation. The two types are known as integrative negotiations and distributive negotiations. Integrative...
Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud
INFOCOM
2008
IEEE
16 years 1 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
LICS
2008
IEEE
16 years 1 months ago
From Automatic Structures to Borel Structures
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...