返回Google圖書搜尋

Preferences Over Objects, Sets and Sequences

出版	INTECH Open Access Publisher, 2008
ISBN	95376190369789537619039
URL	http://books.google.com.hk/books?id=hMKQoAEACAAJ&hl=&source=gbs_api

註釋In this chapter, we have presented several approaches for treating preferences over objects, sets of objects and sequences of objects. The main contribution is centered in Section 4 which presents a method for preference elicitation and reasoning over sequence of objects. An algorithm for finding the most preferred sequences satisfying a set of temporal constraints is introduced. A lot of work has to be done to improve our approach. (1) Concerning the algorithm for finding the best sequences, we intend to generalize our method in order to treat more general temporal constraints. (2) Concerning the expressivity power of our preference language: we note that in TPref the temporal aspect is related only to the rule conditions, that is, only to the left side of the preference rules. We are not able, for the time being, to treat preference statements such as I prefer "this" before "that". (3) Concerning the consistency test: we must investigate methods to ensure consistency when the temporal conditions involve both past and future operators. (4) Concerning dominance queries: we have to investigate efficient methods to determine, given two sequences, which is the preferred one. That implies investigating efficient methods to decide, given two sequence, if there exists a IFS between them. (5) Finally, concerning a database context, the work proposed in this paper is a first step towards incorporating a formalism for reasoning with preferences over sequences of objects into a temporal relational query language, and so, building a bridge between the two disciplines (AI and Temporal Databases).