This work pertains to the Knuth-Bendix (KB) algorithm which tries to find a complete set of reductions from a given set of equations. In the KB algorithm a term ordering is employ...
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
In this paper, we formally connect between vector median filters, inf-sup morphological operations, and geometric partial differential equations. Considering a lexicographic order,...
This paper deals with iterated belief change and proposes a drastic revision rule that modifies a plausibility ordering of interpretations in such a way that any world where the in...
Salem Benferhat, Didier Dubois, Sylvain Lagrue, Od...
A conversational recommender system iteratively shows a small set of options for its user to choose between. In order to select these options, the system may analyze the queries tr...
Walid Trabelsi, Nic Wilson, Derek G. Bridge, Franc...