Sciweavers

72 search results - page 3 / 15
» Minimal Contraction of Preference Relations
Sort
View
GD
2004
Springer
13 years 11 months ago
Visual Navigation of Compound Graphs
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound ...
Marcus Raitner
ATAL
2005
Springer
13 years 11 months ago
Design by Contract Deontic Design Language for Multiagent Systems
Abstract. Design by contract is a well known theory that views software construction as based on contracts between clients (callers) and suppliers (routines), relying on mutual obl...
Christophe Garion, Leendert van der Torre
BIRTE
2006
139views Business» more  BIRTE 2006»
13 years 10 months ago
Quality Contracts for Real-Time Enterprises
Real-time enterprises rely on user queries being answered in a timely fashion and using fresh data. This is relatively easy when systems are lightly loaded and both queries and upd...
Alexandros Labrinidis, Huiming Qu, Jie Xu
ANOR
2008
69views more  ANOR 2008»
13 years 6 months ago
NP-hardness results for the aggregation of linear orders into median orders
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
Olivier Hudry
ICLP
2004
Springer
13 years 11 months ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir