Sciweavers

696 search results - page 45 / 140
» Prioritising Preference Relations
Sort
View
111
Voted
ECAI
2006
Springer
15 years 7 months ago
A Logic-Based Framework to Compute Pareto Agreements in One-Shot Bilateral Negotiation
Abstract. We propose a logic-based approach to automated oneshot multi-issue bilateral negotiation. We use logic in two ways: (1) a logic theory to represent relations among issues...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
IJAMC
2008
77views more  IJAMC 2008»
15 years 3 months ago
The use of chat by Greek students
: This paper investigates the use of chat by Greek students. An appropriate questionnaire was developed. Among others, the questions attempted to identify the users' preferenc...
Vasileios C. Tsarouchas, Anastasios A. Economides
88
Voted
COLING
2002
15 years 3 months ago
A Corpus-based Analysis for the Ordering of Clause Aggregation Operators
To better understand the ordering of clause aggregation operators in a text generation application, we manually annotated a small corpus. The annotated corpus supports the preferr...
James Shaw
113
Voted
IJAC
2010
76views more  IJAC 2010»
15 years 26 days ago
Normal Forms for Automorphisms of Universal Coxeter Groups and Palindromic Automorphisms of Free Groups
We explicitly construct Markov languages of normal forms for the groups in the title of the paper and closely related groups. A Markov language of normal forms is a choice of &quo...
Adam Piggott, Kim Ruane
160
Voted
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 3 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...