Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
Satisfiability problems on intervals and unit intervals
Ordal'94 Selected papers from the conference on Orders, algorithms and applications
Generalizations of semiorders: a review note
Journal of Mathematical Psychology
Maintaining knowledge about temporal intervals
Communications of the ACM
A characterization of PQI interval orders
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Valued Hesitation in Intervals Comparison
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
| Hi-index | 0.00 |
We consider the problem of numerical representations of PQI interval orders. A preference structure on a finite set A with three relations P,Q,I standing for ''strict preference'', ''weak preference'' and ''indifference'', respectively, is defined as a PQI interval order iff there exists a representation of each element of A by an interval in such a way that, P holds when one interval is completely to the right of the other, I holds when one interval is included to the other and Q holds when one interval is to the right of the other, but they do have a non-empty intersection (Q modelling the hesitation between P and I). Only recently, necessary and sufficient conditions for a PQI preference structure to be identified as a PQI interval order have been established. In this paper, we are interested in the problem of constructing a numerical representation of a PQI interval order and possibly a minimal one. We present two algorithms, the first one in O(n^2) aimed to determine a general numerical representation, and the second one, in O(n), aimed to minimise such a representation.