Voting rules map collections of preference orderings over a set of candidates (one for each voter) to candidates. Now, in many contexts, we have to consider the case where either t...
Knuth [14] asked whether the stable matching problem can be generalised to three dimensions i. e., for families containing a man, a woman and a dog. Subsequently, several authors ...
One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this spec...
Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowsk...
Orderings and inference relations can be successfully used to model the behavior of a rational agent. This behavior is indeed represented either by a set of ordered pairs that ref...
Recent years have seen a growing interest in research into patent retrieval. One of the key issues in conducting information retrieval (IR) research is meaningful evaluation of the...