• Publications
  • Influence
When are elections with few candidates hard to manipulate?
TLDR
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Expand
  • 337
  • 39
  • PDF
Voting procedures with incomplete preferences
TLDR
We extend the application of a voting procedure (usually defined on complete preference relations over candidates) when the voters’ preferences consist of partial orders. Expand
  • 232
  • 34
  • PDF
Inconsistency Management and Prioritized Syntax-Based Entailment
TLDR
We study the behavior of non-monotonic inferences induced by various methods for priority-based handling of classical formulas. Expand
  • 377
  • 28
  • PDF
Propositional Independence - Formula-Variable Independence and Forgetting
TLDR
Independence - the study of what is relevant to a given problem of reasoning - has received an increasing attention from the AI community. Expand
  • 216
  • 22
  • PDF
The computational complexity of dominance and consistency in CP-nets
TLDR
We show that both dominance and consistency testing for general CP-nets are PSPACE-complete, and this holds even for the propositional case. Expand
  • 162
  • 19
  • PDF
Logical Preference Representation and Combinatorial Vote
  • J. Lang
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 1 September 2004
TLDR
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independent variables to assign. Expand
  • 160
  • 19
  • PDF
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach
TLDR
We propose a framework for dealing with probabilistic uncertainty in constraint satisfaction problems, associating with each constraint the probability that it is a part of the real problem (the latter being only partially known). Expand
  • 186
  • 14
DA2 merging operators
A new framework for propositional merging is presented. DA2 merging operators, parameterized by a distance between interpretations and two aggregation functions, are introduced. Many distances andExpand
  • 169
  • 13
Sequential composition of voting rules in multi-issue domains
TLDR
In many real-world group decision making problems, the set of alternatives is a Cartesian product of finite value domains for each of a given set of variables (or issues). Expand
  • 119
  • 13
  • PDF
Mixed Constraint Satisfaction: A Framework for Decision Problems under Incomplete Knowledge
TLDR
We extend the CSP framework so as to represent decision problems under incomplete knowledge. Expand
  • 109
  • 12